Submission #125364

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
125364	2019-07-05T06:57:17 Z	구재현(#3066)	Arranging Tickets (JOI17_arranging_tickets)	C++14	10 / 100	401 ms	388 KB

arranging_tickets

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 25;

int n, m;
int a[MAXN], b[MAXN], c[MAXN];

int main(){
	cin >> n >> m;
	if(n + m > 50) return 0;
	for(int i=0; i<m; i++){
		cin >> a[i] >> b[i] >> c[i];
		if(a[i] > b[i]) swap(a[i], b[i]);
	}
	int ret = 1e9;
	for(int i=0; i<(1<<n); i++){
		int cnt[MAXN] = {};
		for(int j=0; j<n; j++){
			if((i >> j) & 1){
				for(int k=a[j]; k<b[j]; k++) cnt[k]++;
			}
			else{
				for(int k=1; k<=n; k++) cnt[k]++;
				for(int k=a[j]; k<b[j]; k++) cnt[k]--;
			}
		}
		ret = min(ret, *max_element(cnt, cnt + n + 1));
	}
	cout << ret << endl;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	364 ms	256 KB	Output is correct
2	Correct	355 ms	376 KB	Output is correct
3	Correct	395 ms	376 KB	Output is correct
4	Correct	343 ms	380 KB	Output is correct
5	Correct	342 ms	356 KB	Output is correct
6	Correct	390 ms	356 KB	Output is correct
7	Correct	367 ms	376 KB	Output is correct
8	Correct	347 ms	352 KB	Output is correct
9	Correct	376 ms	376 KB	Output is correct
10	Correct	362 ms	256 KB	Output is correct
11	Correct	370 ms	376 KB	Output is correct
12	Correct	401 ms	388 KB	Output is correct
13	Correct	368 ms	352 KB	Output is correct
14	Correct	360 ms	256 KB	Output is correct
15	Correct	362 ms	356 KB	Output is correct

Subtask #2

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	364 ms	256 KB	Output is correct
2	Correct	355 ms	376 KB	Output is correct
3	Correct	395 ms	376 KB	Output is correct
4	Correct	343 ms	380 KB	Output is correct
5	Correct	342 ms	356 KB	Output is correct
6	Correct	390 ms	356 KB	Output is correct
7	Correct	367 ms	376 KB	Output is correct
8	Correct	347 ms	352 KB	Output is correct
9	Correct	376 ms	376 KB	Output is correct
10	Correct	362 ms	256 KB	Output is correct
11	Correct	370 ms	376 KB	Output is correct
12	Correct	401 ms	388 KB	Output is correct
13	Correct	368 ms	352 KB	Output is correct
14	Correct	360 ms	256 KB	Output is correct
15	Correct	362 ms	356 KB	Output is correct
16	Incorrect	2 ms	376 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	364 ms	256 KB	Output is correct
2	Correct	355 ms	376 KB	Output is correct
3	Correct	395 ms	376 KB	Output is correct
4	Correct	343 ms	380 KB	Output is correct
5	Correct	342 ms	356 KB	Output is correct
6	Correct	390 ms	356 KB	Output is correct
7	Correct	367 ms	376 KB	Output is correct
8	Correct	347 ms	352 KB	Output is correct
9	Correct	376 ms	376 KB	Output is correct
10	Correct	362 ms	256 KB	Output is correct
11	Correct	370 ms	376 KB	Output is correct
12	Correct	401 ms	388 KB	Output is correct
13	Correct	368 ms	352 KB	Output is correct
14	Correct	360 ms	256 KB	Output is correct
15	Correct	362 ms	356 KB	Output is correct
16	Incorrect	2 ms	376 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	364 ms	256 KB	Output is correct
2	Correct	355 ms	376 KB	Output is correct
3	Correct	395 ms	376 KB	Output is correct
4	Correct	343 ms	380 KB	Output is correct
5	Correct	342 ms	356 KB	Output is correct
6	Correct	390 ms	356 KB	Output is correct
7	Correct	367 ms	376 KB	Output is correct
8	Correct	347 ms	352 KB	Output is correct
9	Correct	376 ms	376 KB	Output is correct
10	Correct	362 ms	256 KB	Output is correct
11	Correct	370 ms	376 KB	Output is correct
12	Correct	401 ms	388 KB	Output is correct
13	Correct	368 ms	352 KB	Output is correct
14	Correct	360 ms	256 KB	Output is correct
15	Correct	362 ms	356 KB	Output is correct
16	Incorrect	2 ms	376 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #5

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	364 ms	256 KB	Output is correct
2	Correct	355 ms	376 KB	Output is correct
3	Correct	395 ms	376 KB	Output is correct
4	Correct	343 ms	380 KB	Output is correct
5	Correct	342 ms	356 KB	Output is correct
6	Correct	390 ms	356 KB	Output is correct
7	Correct	367 ms	376 KB	Output is correct
8	Correct	347 ms	352 KB	Output is correct
9	Correct	376 ms	376 KB	Output is correct
10	Correct	362 ms	256 KB	Output is correct
11	Correct	370 ms	376 KB	Output is correct
12	Correct	401 ms	388 KB	Output is correct
13	Correct	368 ms	352 KB	Output is correct
14	Correct	360 ms	256 KB	Output is correct
15	Correct	362 ms	356 KB	Output is correct
16	Incorrect	2 ms	376 KB	Output isn't correct
17	Halted	0 ms	0 KB	-