# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
201547 | 2020-02-11T03:24:46 Z | Rakhmand | Meetings (JOI19_meetings) | C++14 | 2000 ms | 504 KB |
#include "meetings.h" #include <cstring> #include <list> #include <map> #include <deque> #include <stack> #include <bitset> #include <functional> #include <numeric> #include <sstream> #include <iostream> #include <iomanip> #include <queue> #include <cmath> #include <ctime> #include <cassert> #include <iterator> using namespace std; void Solve(int N) { vector<pair<int, int> > v; for(int a = 0; a < N; a++){ for(int b = a + 1; b < N; b++){ int cnt = 0; for(int i = 0; i < N; i++){ if(a == i || b == i){ continue; } int cent = Query(i, a, b); if(cent == b || cent == a){ cnt++; } } if(cnt == N - 2){ v.push_back({a, b}); } } } for(int i = 0; i < v.size(); i++){ Bridge(v[i].first, v[i].second); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 248 KB | Output is correct |
2 | Correct | 5 ms | 376 KB | Output is correct |
3 | Correct | 5 ms | 376 KB | Output is correct |
4 | Correct | 5 ms | 248 KB | Output is correct |
5 | Correct | 5 ms | 376 KB | Output is correct |
6 | Correct | 4 ms | 248 KB | Output is correct |
7 | Correct | 5 ms | 376 KB | Output is correct |
8 | Correct | 5 ms | 248 KB | Output is correct |
9 | Correct | 5 ms | 248 KB | Output is correct |
10 | Correct | 5 ms | 376 KB | Output is correct |
11 | Correct | 5 ms | 376 KB | Output is correct |
12 | Correct | 6 ms | 376 KB | Output is correct |
13 | Correct | 5 ms | 248 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 248 KB | Output is correct |
2 | Correct | 5 ms | 376 KB | Output is correct |
3 | Correct | 5 ms | 376 KB | Output is correct |
4 | Correct | 5 ms | 248 KB | Output is correct |
5 | Correct | 5 ms | 376 KB | Output is correct |
6 | Correct | 4 ms | 248 KB | Output is correct |
7 | Correct | 5 ms | 376 KB | Output is correct |
8 | Correct | 5 ms | 248 KB | Output is correct |
9 | Correct | 5 ms | 248 KB | Output is correct |
10 | Correct | 5 ms | 376 KB | Output is correct |
11 | Correct | 5 ms | 376 KB | Output is correct |
12 | Correct | 6 ms | 376 KB | Output is correct |
13 | Correct | 5 ms | 248 KB | Output is correct |
14 | Correct | 40 ms | 376 KB | Output is correct |
15 | Correct | 38 ms | 380 KB | Output is correct |
16 | Correct | 35 ms | 248 KB | Output is correct |
17 | Correct | 39 ms | 248 KB | Output is correct |
18 | Correct | 40 ms | 376 KB | Output is correct |
19 | Correct | 44 ms | 248 KB | Output is correct |
20 | Correct | 37 ms | 376 KB | Output is correct |
21 | Correct | 38 ms | 376 KB | Output is correct |
22 | Correct | 38 ms | 252 KB | Output is correct |
23 | Correct | 43 ms | 248 KB | Output is correct |
24 | Correct | 47 ms | 380 KB | Output is correct |
25 | Correct | 48 ms | 376 KB | Output is correct |
26 | Correct | 46 ms | 248 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 248 KB | Output is correct |
2 | Correct | 5 ms | 376 KB | Output is correct |
3 | Correct | 5 ms | 376 KB | Output is correct |
4 | Correct | 5 ms | 248 KB | Output is correct |
5 | Correct | 5 ms | 376 KB | Output is correct |
6 | Correct | 4 ms | 248 KB | Output is correct |
7 | Correct | 5 ms | 376 KB | Output is correct |
8 | Correct | 5 ms | 248 KB | Output is correct |
9 | Correct | 5 ms | 248 KB | Output is correct |
10 | Correct | 5 ms | 376 KB | Output is correct |
11 | Correct | 5 ms | 376 KB | Output is correct |
12 | Correct | 6 ms | 376 KB | Output is correct |
13 | Correct | 5 ms | 248 KB | Output is correct |
14 | Correct | 40 ms | 376 KB | Output is correct |
15 | Correct | 38 ms | 380 KB | Output is correct |
16 | Correct | 35 ms | 248 KB | Output is correct |
17 | Correct | 39 ms | 248 KB | Output is correct |
18 | Correct | 40 ms | 376 KB | Output is correct |
19 | Correct | 44 ms | 248 KB | Output is correct |
20 | Correct | 37 ms | 376 KB | Output is correct |
21 | Correct | 38 ms | 376 KB | Output is correct |
22 | Correct | 38 ms | 252 KB | Output is correct |
23 | Correct | 43 ms | 248 KB | Output is correct |
24 | Correct | 47 ms | 380 KB | Output is correct |
25 | Correct | 48 ms | 376 KB | Output is correct |
26 | Correct | 46 ms | 248 KB | Output is correct |
27 | Incorrect | 349 ms | 376 KB | Wrong Answer [2] |
28 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3066 ms | 504 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |