# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
125363 | 2019-07-05T06:56:03 Z | 임유진(#3061) | Arranging Tickets (JOI17_arranging_tickets) | C++14 | 150 ms | 508 KB |
#include<stdio.h> #include<algorithm> using namespace std; int main() { int N, M; int A[20], B[20], C[20]; int s[22]; int ans = 50; scanf("%d%d", &N, &M); for(int i = 0; i < M; i++) scanf("%d%d%d", A + i, B + i, C + i); for(int i = 0; i < M; i++) if(A[i] > B[i]) swap(A[i], B[i]); for(int i = 0; i < (1 << M); i++) { for(int j = 0; j < N; j++) s[j] = 0; for(int j = 0; j < M; j++) { if(i & (1 << j)) { s[A[j]]++; s[B[j]]--; } else { s[1]++; s[A[j]]--; s[B[j]]++; } } int sum = 0; for(int j = 1; j < N; j++) { s[j] += s[j - 1]; sum = max(sum, s[j]); } ans = min(ans, sum); } printf("%d", ans); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 146 ms | 380 KB | Output is correct |
2 | Correct | 145 ms | 504 KB | Output is correct |
3 | Correct | 147 ms | 380 KB | Output is correct |
4 | Correct | 144 ms | 376 KB | Output is correct |
5 | Correct | 146 ms | 256 KB | Output is correct |
6 | Correct | 148 ms | 376 KB | Output is correct |
7 | Correct | 145 ms | 368 KB | Output is correct |
8 | Correct | 146 ms | 384 KB | Output is correct |
9 | Correct | 144 ms | 376 KB | Output is correct |
10 | Correct | 146 ms | 256 KB | Output is correct |
11 | Correct | 144 ms | 256 KB | Output is correct |
12 | Correct | 145 ms | 384 KB | Output is correct |
13 | Correct | 145 ms | 508 KB | Output is correct |
14 | Correct | 145 ms | 504 KB | Output is correct |
15 | Correct | 150 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 146 ms | 380 KB | Output is correct |
2 | Correct | 145 ms | 504 KB | Output is correct |
3 | Correct | 147 ms | 380 KB | Output is correct |
4 | Correct | 144 ms | 376 KB | Output is correct |
5 | Correct | 146 ms | 256 KB | Output is correct |
6 | Correct | 148 ms | 376 KB | Output is correct |
7 | Correct | 145 ms | 368 KB | Output is correct |
8 | Correct | 146 ms | 384 KB | Output is correct |
9 | Correct | 144 ms | 376 KB | Output is correct |
10 | Correct | 146 ms | 256 KB | Output is correct |
11 | Correct | 144 ms | 256 KB | Output is correct |
12 | Correct | 145 ms | 384 KB | Output is correct |
13 | Correct | 145 ms | 508 KB | Output is correct |
14 | Correct | 145 ms | 504 KB | Output is correct |
15 | Correct | 150 ms | 376 KB | Output is correct |
16 | Runtime error | 6 ms | 376 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
17 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 146 ms | 380 KB | Output is correct |
2 | Correct | 145 ms | 504 KB | Output is correct |
3 | Correct | 147 ms | 380 KB | Output is correct |
4 | Correct | 144 ms | 376 KB | Output is correct |
5 | Correct | 146 ms | 256 KB | Output is correct |
6 | Correct | 148 ms | 376 KB | Output is correct |
7 | Correct | 145 ms | 368 KB | Output is correct |
8 | Correct | 146 ms | 384 KB | Output is correct |
9 | Correct | 144 ms | 376 KB | Output is correct |
10 | Correct | 146 ms | 256 KB | Output is correct |
11 | Correct | 144 ms | 256 KB | Output is correct |
12 | Correct | 145 ms | 384 KB | Output is correct |
13 | Correct | 145 ms | 508 KB | Output is correct |
14 | Correct | 145 ms | 504 KB | Output is correct |
15 | Correct | 150 ms | 376 KB | Output is correct |
16 | Runtime error | 6 ms | 376 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
17 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 146 ms | 380 KB | Output is correct |
2 | Correct | 145 ms | 504 KB | Output is correct |
3 | Correct | 147 ms | 380 KB | Output is correct |
4 | Correct | 144 ms | 376 KB | Output is correct |
5 | Correct | 146 ms | 256 KB | Output is correct |
6 | Correct | 148 ms | 376 KB | Output is correct |
7 | Correct | 145 ms | 368 KB | Output is correct |
8 | Correct | 146 ms | 384 KB | Output is correct |
9 | Correct | 144 ms | 376 KB | Output is correct |
10 | Correct | 146 ms | 256 KB | Output is correct |
11 | Correct | 144 ms | 256 KB | Output is correct |
12 | Correct | 145 ms | 384 KB | Output is correct |
13 | Correct | 145 ms | 508 KB | Output is correct |
14 | Correct | 145 ms | 504 KB | Output is correct |
15 | Correct | 150 ms | 376 KB | Output is correct |
16 | Runtime error | 6 ms | 376 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
17 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 146 ms | 380 KB | Output is correct |
2 | Correct | 145 ms | 504 KB | Output is correct |
3 | Correct | 147 ms | 380 KB | Output is correct |
4 | Correct | 144 ms | 376 KB | Output is correct |
5 | Correct | 146 ms | 256 KB | Output is correct |
6 | Correct | 148 ms | 376 KB | Output is correct |
7 | Correct | 145 ms | 368 KB | Output is correct |
8 | Correct | 146 ms | 384 KB | Output is correct |
9 | Correct | 144 ms | 376 KB | Output is correct |
10 | Correct | 146 ms | 256 KB | Output is correct |
11 | Correct | 144 ms | 256 KB | Output is correct |
12 | Correct | 145 ms | 384 KB | Output is correct |
13 | Correct | 145 ms | 508 KB | Output is correct |
14 | Correct | 145 ms | 504 KB | Output is correct |
15 | Correct | 150 ms | 376 KB | Output is correct |
16 | Runtime error | 6 ms | 376 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
17 | Halted | 0 ms | 0 KB | - |