# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
813388 | 2023-08-07T16:40:35 Z | Andrey | 최후의 만찬 (IOI12_supper) | C++14 | 2500 ms | 4304 KB |
#include<bits/stdc++.h> #include "advisor.h" using namespace std; void ComputeAdvice(int *c, int n, int k, int m) { vector<int> br(n); for(int i = 0; i < n; i++) { br[c[i]]++; } for(int i = 0; i < n; i++) { for(int j = 0; j < br[i]; j++) { WriteAdvice(1); } WriteAdvice(0); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 536 KB | Output isn't correct - not an optimal way |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 291 ms | 976 KB | Output isn't correct - not an optimal way |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2582 ms | 3464 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 50 ms | 704 KB | Output isn't correct - not an optimal way |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2541 ms | 4156 KB | Time limit exceeded |
2 | Execution timed out | 2586 ms | 4224 KB | Time limit exceeded |
3 | Execution timed out | 2575 ms | 4216 KB | Time limit exceeded |
4 | Execution timed out | 2573 ms | 4268 KB | Time limit exceeded |
5 | Execution timed out | 2582 ms | 4124 KB | Time limit exceeded |
6 | Execution timed out | 2594 ms | 4300 KB | Time limit exceeded |
7 | Execution timed out | 2509 ms | 4304 KB | Time limit exceeded |
8 | Execution timed out | 2601 ms | 4200 KB | Time limit exceeded |
9 | Execution timed out | 2557 ms | 4192 KB | Time limit exceeded |
10 | Execution timed out | 2503 ms | 4244 KB | Time limit exceeded |