Submission #125391

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
125391	2019-07-05T07:33:16 Z	khsoo01	Arranging Tickets (JOI17_arranging_tickets)	C++11	10 / 100	244 ms	476 KB

arranging_tickets

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

const int N = 25, inf = 1e9;

int n, m, a[N], b[N], s[N], ans = inf;

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

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:10:7: 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:12:8: 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	149 ms	376 KB	Output is correct
2	Correct	150 ms	376 KB	Output is correct
3	Correct	148 ms	256 KB	Output is correct
4	Correct	147 ms	376 KB	Output is correct
5	Correct	148 ms	376 KB	Output is correct
6	Correct	147 ms	376 KB	Output is correct
7	Correct	147 ms	376 KB	Output is correct
8	Correct	149 ms	376 KB	Output is correct
9	Correct	147 ms	476 KB	Output is correct
10	Correct	148 ms	476 KB	Output is correct
11	Correct	148 ms	376 KB	Output is correct
12	Correct	148 ms	376 KB	Output is correct
13	Correct	152 ms	352 KB	Output is correct
14	Correct	149 ms	356 KB	Output is correct
15	Correct	151 ms	392 KB	Output is correct

Subtask #2

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	149 ms	376 KB	Output is correct
2	Correct	150 ms	376 KB	Output is correct
3	Correct	148 ms	256 KB	Output is correct
4	Correct	147 ms	376 KB	Output is correct
5	Correct	148 ms	376 KB	Output is correct
6	Correct	147 ms	376 KB	Output is correct
7	Correct	147 ms	376 KB	Output is correct
8	Correct	149 ms	376 KB	Output is correct
9	Correct	147 ms	476 KB	Output is correct
10	Correct	148 ms	476 KB	Output is correct
11	Correct	148 ms	376 KB	Output is correct
12	Correct	148 ms	376 KB	Output is correct
13	Correct	152 ms	352 KB	Output is correct
14	Correct	149 ms	356 KB	Output is correct
15	Correct	151 ms	392 KB	Output is correct
16	Incorrect	244 ms	356 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	149 ms	376 KB	Output is correct
2	Correct	150 ms	376 KB	Output is correct
3	Correct	148 ms	256 KB	Output is correct
4	Correct	147 ms	376 KB	Output is correct
5	Correct	148 ms	376 KB	Output is correct
6	Correct	147 ms	376 KB	Output is correct
7	Correct	147 ms	376 KB	Output is correct
8	Correct	149 ms	376 KB	Output is correct
9	Correct	147 ms	476 KB	Output is correct
10	Correct	148 ms	476 KB	Output is correct
11	Correct	148 ms	376 KB	Output is correct
12	Correct	148 ms	376 KB	Output is correct
13	Correct	152 ms	352 KB	Output is correct
14	Correct	149 ms	356 KB	Output is correct
15	Correct	151 ms	392 KB	Output is correct
16	Incorrect	244 ms	356 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	149 ms	376 KB	Output is correct
2	Correct	150 ms	376 KB	Output is correct
3	Correct	148 ms	256 KB	Output is correct
4	Correct	147 ms	376 KB	Output is correct
5	Correct	148 ms	376 KB	Output is correct
6	Correct	147 ms	376 KB	Output is correct
7	Correct	147 ms	376 KB	Output is correct
8	Correct	149 ms	376 KB	Output is correct
9	Correct	147 ms	476 KB	Output is correct
10	Correct	148 ms	476 KB	Output is correct
11	Correct	148 ms	376 KB	Output is correct
12	Correct	148 ms	376 KB	Output is correct
13	Correct	152 ms	352 KB	Output is correct
14	Correct	149 ms	356 KB	Output is correct
15	Correct	151 ms	392 KB	Output is correct
16	Incorrect	244 ms	356 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #5

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	149 ms	376 KB	Output is correct
2	Correct	150 ms	376 KB	Output is correct
3	Correct	148 ms	256 KB	Output is correct
4	Correct	147 ms	376 KB	Output is correct
5	Correct	148 ms	376 KB	Output is correct
6	Correct	147 ms	376 KB	Output is correct
7	Correct	147 ms	376 KB	Output is correct
8	Correct	149 ms	376 KB	Output is correct
9	Correct	147 ms	476 KB	Output is correct
10	Correct	148 ms	476 KB	Output is correct
11	Correct	148 ms	376 KB	Output is correct
12	Correct	148 ms	376 KB	Output is correct
13	Correct	152 ms	352 KB	Output is correct
14	Correct	149 ms	356 KB	Output is correct
15	Correct	151 ms	392 KB	Output is correct
16	Incorrect	244 ms	356 KB	Output isn't correct
17	Halted	0 ms	0 KB	-