Submission

[-S][-S][-SS][P-S][-SS][PPPPP][-SSSSSS][PPPP][PPPP][PPPPP]

Score: 40

User: Winzzwz

Problemset: ช่องบนไม้

Language: cpp

Time: 0.016 second

Submitted On: 2025-03-09 00:52:04

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int n,w,l,k,nn,gch;
vector<int> t[10];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> w >> l;
    for (int i = 1; i <= n; i++) {
        cin >> k;
        for (int j = 1; j <= k; j++) {
            cin >> nn;
            t[i].push_back(nn);
        }
    }
    for (int i = 1; i <= w; i++) {
        int ch = 1;
        for (int j = 1; j <= n; j++) {
            int pos = lower_bound(t[j].begin(),t[j].end(),i)-t[j].begin();
            if (pos == t[j].size()) pos--;
            int v = t[j][pos];
            if (pos > 0) v = min(v,t[j][pos-1]);
            //cout << i << " " << j << " " << pos << " " << v << "\n";
            if (abs(i-v) > l) {ch = 0; break;}
        }
        if (ch) {gch = 1; break;}
    }
    if (gch) cout << "1\n";
    else cout << "0\n";
    return 0;
}