# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
813014 | 2023-08-07T12:41:08 Z | Andrey | Last supper (IOI12_supper) | C++14 | 2500 ms | 10452 KB |
#include<bits/stdc++.h> #include "advisor.h" using namespace std; vector<int> haha[100001]; void ComputeAdvice(int *c, int n, int k, int m) { int br = 0,z = 1; while(z <= n) { z*=2; br++; } vector<int> ans(0); vector<int> p(n); vector<bool> bruh(n); int a,b; priority_queue<pair<int,int>> idk; for(int i = 0; i < n; i++) { haha[c[i]].push_back(i); } for(int i = 0; i < n; i++) { haha[i].push_back(INT_MAX); } for(int i = 0; i < k; i++) { bruh[i] = true; idk.push({haha[i][0],i}); } for(int i = 0; i < n; i++) { if(bruh[c[i]]) { p[c[i]]++; idk.push({haha[c[i]][p[c[i]]],c[i]}); ans.push_back(INT_MAX); } else { a = idk.top().first; b = idk.top().second; bruh[b] = false; idk.pop(); ans.push_back(b); p[c[i]]++; idk.push({haha[c[i]][p[c[i]]],c[i]}); bruh[c[i]] = true; } } vector<int> sb(n); for(int i = 0; i < n; i++) { if(ans[i] != INT_MAX) { sb[ans[i]]++; } } for(int i = 0; i < n; i++) { for(int j = 0; j < sb[i]; j++) { WriteAdvice(1); } WriteAdvice(0); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 2956 KB | Output isn't correct - not an optimal way |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 118 ms | 3748 KB | Output isn't correct - not an optimal way |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2508 ms | 9020 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 20 ms | 3240 KB | Output isn't correct - not an optimal way |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2505 ms | 10168 KB | Time limit exceeded |
2 | Execution timed out | 2542 ms | 10168 KB | Time limit exceeded |
3 | Execution timed out | 2530 ms | 10268 KB | Time limit exceeded |
4 | Execution timed out | 2504 ms | 10268 KB | Time limit exceeded |
5 | Execution timed out | 2595 ms | 10188 KB | Time limit exceeded |
6 | Execution timed out | 2514 ms | 10352 KB | Time limit exceeded |
7 | Execution timed out | 2524 ms | 10232 KB | Time limit exceeded |
8 | Execution timed out | 2503 ms | 10248 KB | Time limit exceeded |
9 | Execution timed out | 2508 ms | 10248 KB | Time limit exceeded |
10 | Execution timed out | 2527 ms | 10452 KB | Time limit exceeded |