Submission #125339

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
125339	2019-07-05T06:03:05 Z	송준혁(#3062)	Arranging Tickets (JOI17_arranging_tickets)	C++14	10 / 100	60 ms	504 KB

arranging_tickets

#include <bits/stdc++.h>
using namespace std;

int N, M, ans=1234567890;
int A[30], B[30], C[30], D[30];

void f(int lv){
    if (lv > M){
        int Max = 0;
        for (int i=1; i<=N; i++) {
            D[i] = D[i-1] + C[i-1];
            Max = max(Max, D[i]);
        }
        ans = min(ans, Max);
        return;
    }
    C[A[lv]]++, C[B[lv]]--;
    f(lv+1);
    C[A[lv]]--, C[B[lv]]++;

    C[1]++, C[A[lv]]--, C[B[lv]]++;
    f(lv+1);
    C[1]--, C[A[lv]]++, C[B[lv]]--;
}

int main(){
    scanf("%d %d", &N, &M);
    for (int i=1; i<=M; i++) {
        scanf("%d %d %*d", &A[i], &B[i]);
        if (A[i] > B[i]) swap(A[i], B[i]);
    }
    f(1);
    printf("%d\n", ans);
    return 0;
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &N, &M);
     ~~~~~^~~~~~~~~~~~~~~~~
arranging_tickets.cpp:29:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %*d", &A[i], &B[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	60 ms	256 KB	Output is correct
2	Correct	60 ms	364 KB	Output is correct
3	Correct	56 ms	396 KB	Output is correct
4	Correct	56 ms	376 KB	Output is correct
5	Correct	57 ms	256 KB	Output is correct
6	Correct	56 ms	376 KB	Output is correct
7	Correct	56 ms	376 KB	Output is correct
8	Correct	56 ms	504 KB	Output is correct
9	Correct	56 ms	252 KB	Output is correct
10	Correct	56 ms	256 KB	Output is correct
11	Correct	56 ms	376 KB	Output is correct
12	Correct	56 ms	376 KB	Output is correct
13	Correct	56 ms	256 KB	Output is correct
14	Correct	59 ms	376 KB	Output is correct
15	Correct	57 ms	256 KB	Output is correct

Subtask #2

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	60 ms	256 KB	Output is correct
2	Correct	60 ms	364 KB	Output is correct
3	Correct	56 ms	396 KB	Output is correct
4	Correct	56 ms	376 KB	Output is correct
5	Correct	57 ms	256 KB	Output is correct
6	Correct	56 ms	376 KB	Output is correct
7	Correct	56 ms	376 KB	Output is correct
8	Correct	56 ms	504 KB	Output is correct
9	Correct	56 ms	252 KB	Output is correct
10	Correct	56 ms	256 KB	Output is correct
11	Correct	56 ms	376 KB	Output is correct
12	Correct	56 ms	376 KB	Output is correct
13	Correct	56 ms	256 KB	Output is correct
14	Correct	59 ms	376 KB	Output is correct
15	Correct	57 ms	256 KB	Output is correct
16	Runtime error	2 ms	376 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
17	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	60 ms	256 KB	Output is correct
2	Correct	60 ms	364 KB	Output is correct
3	Correct	56 ms	396 KB	Output is correct
4	Correct	56 ms	376 KB	Output is correct
5	Correct	57 ms	256 KB	Output is correct
6	Correct	56 ms	376 KB	Output is correct
7	Correct	56 ms	376 KB	Output is correct
8	Correct	56 ms	504 KB	Output is correct
9	Correct	56 ms	252 KB	Output is correct
10	Correct	56 ms	256 KB	Output is correct
11	Correct	56 ms	376 KB	Output is correct
12	Correct	56 ms	376 KB	Output is correct
13	Correct	56 ms	256 KB	Output is correct
14	Correct	59 ms	376 KB	Output is correct
15	Correct	57 ms	256 KB	Output is correct
16	Runtime error	2 ms	376 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
17	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	60 ms	256 KB	Output is correct
2	Correct	60 ms	364 KB	Output is correct
3	Correct	56 ms	396 KB	Output is correct
4	Correct	56 ms	376 KB	Output is correct
5	Correct	57 ms	256 KB	Output is correct
6	Correct	56 ms	376 KB	Output is correct
7	Correct	56 ms	376 KB	Output is correct
8	Correct	56 ms	504 KB	Output is correct
9	Correct	56 ms	252 KB	Output is correct
10	Correct	56 ms	256 KB	Output is correct
11	Correct	56 ms	376 KB	Output is correct
12	Correct	56 ms	376 KB	Output is correct
13	Correct	56 ms	256 KB	Output is correct
14	Correct	59 ms	376 KB	Output is correct
15	Correct	57 ms	256 KB	Output is correct
16	Runtime error	2 ms	376 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
17	Halted	0 ms	0 KB	-

Subtask #5

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	60 ms	256 KB	Output is correct
2	Correct	60 ms	364 KB	Output is correct
3	Correct	56 ms	396 KB	Output is correct
4	Correct	56 ms	376 KB	Output is correct
5	Correct	57 ms	256 KB	Output is correct
6	Correct	56 ms	376 KB	Output is correct
7	Correct	56 ms	376 KB	Output is correct
8	Correct	56 ms	504 KB	Output is correct
9	Correct	56 ms	252 KB	Output is correct
10	Correct	56 ms	256 KB	Output is correct
11	Correct	56 ms	376 KB	Output is correct
12	Correct	56 ms	376 KB	Output is correct
13	Correct	56 ms	256 KB	Output is correct
14	Correct	59 ms	376 KB	Output is correct
15	Correct	57 ms	256 KB	Output is correct
16	Runtime error	2 ms	376 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
17	Halted	0 ms	0 KB	-