# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
813380 | 2023-08-07T16:36:58 Z | Andrey | 최후의 만찬 (IOI12_supper) | C++14 | 2500 ms | 4340 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 | 508 KB | Output isn't correct - not an optimal way |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 303 ms | 992 KB | Output isn't correct - not an optimal way |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2566 ms | 3472 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 44 ms | 676 KB | Output isn't correct - not an optimal way |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2504 ms | 4200 KB | Time limit exceeded |
2 | Execution timed out | 2590 ms | 4228 KB | Time limit exceeded |
3 | Execution timed out | 2505 ms | 4340 KB | Time limit exceeded |
4 | Execution timed out | 2573 ms | 4240 KB | Time limit exceeded |
5 | Execution timed out | 2508 ms | 4328 KB | Time limit exceeded |
6 | Execution timed out | 2516 ms | 4180 KB | Time limit exceeded |
7 | Execution timed out | 2513 ms | 4236 KB | Time limit exceeded |
8 | Execution timed out | 2600 ms | 4252 KB | Time limit exceeded |
9 | Execution timed out | 2589 ms | 4284 KB | Time limit exceeded |
10 | Execution timed out | 2515 ms | 4316 KB | Time limit exceeded |