# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
747525 |
2023-05-24T09:14:49 Z |
vjudge1 |
Kralj (COCI16_kralj) |
C++17 |
|
2000 ms |
11988 KB |
#include "bits/stdc++.h"
#define ll long long
using namespace std;
const ll mod = 1000000007;
vector<int> v[500001];
set<int> s;
int ans;
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// int n;
// cin >> n;
// int a[n], b[n], c[n], be[n] = {}, en[n] = {};
// for(int i = 0; i < n; i++) {
// cin >> a[i];
// be[a[i] - 1]++;
// }
// int x = 0;
// for(int i = 0; i < n; i++) {
// if(be[i]) {
// en[(i + be[i] - 1) % n]++;
// if(i + be[i] - 1 >= n)
// x++;
// }
// }
// int st = 0;
// for(int i = 0; i < n; i++) {
// x += (be[i] > 0);
// if(be[i] && x == 1)
// st = i;
// x -= en[i];
// }
// for(int i = 0; i < n; i++)
// cin >> b[i];
// for(int i = 0; i < n; i++) {
// cin >> c[i];
// v[a[i] - 1].push_back(c[i]);
// }
// for(int i = 0; i < n; i++) {
// for(int j : v[st])
// s.insert(j);
// auto it = s.upper_bound(b[st]);
// if(it != s.end()) {
// ans++;
// s.erase(it);
// }
// else
// s.erase(s.begin());
// st++;
// st %= n;
// }
// cout << ans;
while (1);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2072 ms |
11988 KB |
Time limit exceeded |
2 |
Execution timed out |
2079 ms |
11988 KB |
Time limit exceeded |
3 |
Execution timed out |
2082 ms |
11988 KB |
Time limit exceeded |
4 |
Execution timed out |
2061 ms |
11988 KB |
Time limit exceeded |
5 |
Execution timed out |
2070 ms |
11988 KB |
Time limit exceeded |
6 |
Execution timed out |
2084 ms |
11988 KB |
Time limit exceeded |
7 |
Execution timed out |
2056 ms |
11988 KB |
Time limit exceeded |
8 |
Execution timed out |
2065 ms |
11988 KB |
Time limit exceeded |
9 |
Execution timed out |
2075 ms |
11988 KB |
Time limit exceeded |
10 |
Execution timed out |
2089 ms |
11988 KB |
Time limit exceeded |