Submission #1002821

# Submission time Handle Problem Language Result Execution time Memory
1002821 2024-06-19T20:08:45 Z gabistroeh Autobahn (COI21_autobahn) C++14
50 / 100
1 ms 604 KB
    #include<bits/stdc++.h>
    using namespace std;
     
    const int MAXN = 1010;
    int l[MAXN], r[MAXN], t[MAXN], mark[MAXN];
    int v[MAXN];
    int seg[4*MAXN];
     
    int main(){
    	int n, k, x;
    	cin >> n >> k >> x;
    	for(int i=0; i<n; i++){
    		cin >> l[i] >> t[i] >> r[i];
    		for(int j=l[i]; j<=r[i]; j++){
    			mark[j]++;
    		}
    	}
    	for(int i=0; i<n; i++){
    		int tam = r[i] - l[i] + 1;
    		if(t[i]>=tam) continue;
    		int pes = 0;
    		for(int j=l[i]+t[i]; j<=r[i]; j++){
    			if(mark[j]>=k){
    				v[j]++;
    			}
    		}
    	}
    	//for(int i=1; i<10; i++) cout << v[i] << " ";
    	int resp = 0;
    	for(int i=1; i<=1000-x+1; i++){
    		int cur = 0;
    		for(int j=i; j<i+x; j++){
    			cur+=v[j];
    		}
            //cout << "de " << i << " ate " << i+x-1 << " deu " << cur << endl;
    		//if(cur>resp) cout << cur << endl;
    		resp = max(resp, cur);
    	}
    	cout << resp;
    }

Compilation message

autobahn.cpp: In function 'int main()':
autobahn.cpp:21:11: warning: unused variable 'pes' [-Wunused-variable]
   21 |       int pes = 0;
      |           ^~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Runtime error 1 ms 604 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -