Submission #600543

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
600543	2022-07-21T04:43:13 Z	반딧불(#8467)	Arranging Tickets (JOI17_arranging_tickets)	C++17	10 / 100	131 ms	300 KB

arranging_tickets

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n, k;
int a[22], b[22];
int sum[22];
int ans = INT_MAX;

int main(){
    scanf("%d %d", &n, &k);
    for(int i=1; i<=k; i++){
        int tmp;
        scanf("%d %d %d", &a[i], &b[i], &tmp);
        if(a[i] > b[i]) swap(a[i], b[i]);
    }
    for(int d=0; d<(1<<k); d++){
        for(int i=1; i<=n; i++) sum[i] = 0;
        for(int i=1; i<=k; i++){
            if(d&(1<<(i-1))) sum[a[i]]++, sum[b[i]]--;
            else sum[1]++, sum[a[i]]--, sum[b[i]]++;
        }
        int tmp = 0;
        for(int i=1; i<=n; i++) sum[i] += sum[i-1], tmp = max(tmp, sum[i]);
        ans = min(ans, tmp);
    }
    printf("%d", ans);
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
arranging_tickets.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         scanf("%d %d %d", &a[i], &b[i], &tmp);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	119 ms	212 KB	Output is correct
2	Correct	121 ms	276 KB	Output is correct
3	Correct	131 ms	288 KB	Output is correct
4	Correct	120 ms	276 KB	Output is correct
5	Correct	118 ms	284 KB	Output is correct
6	Correct	116 ms	276 KB	Output is correct
7	Correct	126 ms	212 KB	Output is correct
8	Correct	124 ms	300 KB	Output is correct
9	Correct	119 ms	280 KB	Output is correct
10	Correct	123 ms	276 KB	Output is correct
11	Correct	129 ms	280 KB	Output is correct
12	Correct	119 ms	212 KB	Output is correct
13	Correct	116 ms	212 KB	Output is correct
14	Correct	117 ms	212 KB	Output is correct
15	Correct	130 ms	280 KB	Output is correct

Subtask #2

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	119 ms	212 KB	Output is correct
2	Correct	121 ms	276 KB	Output is correct
3	Correct	131 ms	288 KB	Output is correct
4	Correct	120 ms	276 KB	Output is correct
5	Correct	118 ms	284 KB	Output is correct
6	Correct	116 ms	276 KB	Output is correct
7	Correct	126 ms	212 KB	Output is correct
8	Correct	124 ms	300 KB	Output is correct
9	Correct	119 ms	280 KB	Output is correct
10	Correct	123 ms	276 KB	Output is correct
11	Correct	129 ms	280 KB	Output is correct
12	Correct	119 ms	212 KB	Output is correct
13	Correct	116 ms	212 KB	Output is correct
14	Correct	117 ms	212 KB	Output is correct
15	Correct	130 ms	280 KB	Output is correct
16	Incorrect	1 ms	212 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	119 ms	212 KB	Output is correct
2	Correct	121 ms	276 KB	Output is correct
3	Correct	131 ms	288 KB	Output is correct
4	Correct	120 ms	276 KB	Output is correct
5	Correct	118 ms	284 KB	Output is correct
6	Correct	116 ms	276 KB	Output is correct
7	Correct	126 ms	212 KB	Output is correct
8	Correct	124 ms	300 KB	Output is correct
9	Correct	119 ms	280 KB	Output is correct
10	Correct	123 ms	276 KB	Output is correct
11	Correct	129 ms	280 KB	Output is correct
12	Correct	119 ms	212 KB	Output is correct
13	Correct	116 ms	212 KB	Output is correct
14	Correct	117 ms	212 KB	Output is correct
15	Correct	130 ms	280 KB	Output is correct
16	Incorrect	1 ms	212 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	119 ms	212 KB	Output is correct
2	Correct	121 ms	276 KB	Output is correct
3	Correct	131 ms	288 KB	Output is correct
4	Correct	120 ms	276 KB	Output is correct
5	Correct	118 ms	284 KB	Output is correct
6	Correct	116 ms	276 KB	Output is correct
7	Correct	126 ms	212 KB	Output is correct
8	Correct	124 ms	300 KB	Output is correct
9	Correct	119 ms	280 KB	Output is correct
10	Correct	123 ms	276 KB	Output is correct
11	Correct	129 ms	280 KB	Output is correct
12	Correct	119 ms	212 KB	Output is correct
13	Correct	116 ms	212 KB	Output is correct
14	Correct	117 ms	212 KB	Output is correct
15	Correct	130 ms	280 KB	Output is correct
16	Incorrect	1 ms	212 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #5

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	119 ms	212 KB	Output is correct
2	Correct	121 ms	276 KB	Output is correct
3	Correct	131 ms	288 KB	Output is correct
4	Correct	120 ms	276 KB	Output is correct
5	Correct	118 ms	284 KB	Output is correct
6	Correct	116 ms	276 KB	Output is correct
7	Correct	126 ms	212 KB	Output is correct
8	Correct	124 ms	300 KB	Output is correct
9	Correct	119 ms	280 KB	Output is correct
10	Correct	123 ms	276 KB	Output is correct
11	Correct	129 ms	280 KB	Output is correct
12	Correct	119 ms	212 KB	Output is correct
13	Correct	116 ms	212 KB	Output is correct
14	Correct	117 ms	212 KB	Output is correct
15	Correct	130 ms	280 KB	Output is correct
16	Incorrect	1 ms	212 KB	Output isn't correct
17	Halted	0 ms	0 KB	-