답안 #55026 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
55026	2018-07-05T21:01:51 Z	ksun48	Arranging Tickets (JOI17_arranging_tickets)	C++14	45 / 100	6000 ms	47468 KB

arranging_tickets

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

LL two(vector<vector<LL> > z, LL n){
	LL maxcross = 0;
	LL numcross[n][n];

	vector<LL> ends(n, 0);
	vector<LL> backs[n];
	for(int j = 0; j < z.size(); j++){
		int c = z[j][0];
		int d = z[j][1];
		ends[c]++;
		ends[d]++;
		backs[d].push_back(c);
	}
	for(int a = 0; a < n; a++){
		LL f = 0;
		for(int b = a+1; b < n; b++){
			f += ends[b];
			for(int r : backs[b]){
				if(r >= a+1){
					f -= 2;
				}
			}
			numcross[a][b] = f;
			maxcross = max(maxcross, numcross[a][b]);
		}
	}

	LL realbound = (maxcross + 1) / 2;
	if(maxcross % 2 == 1) return realbound;
	for(int a = 0; a < n; a++){
		for(int c = a+1; c < n; c++){
			if(numcross[a][c] != maxcross) continue;
			for(int b = a+1; b < c; b++){
				for(int d = c+1; d < n; d++){
					if(numcross[b][d] != maxcross) continue;
					if(numcross[a][b] % 2 == 1){
						realbound = maxcross / 2 + 1;
						return realbound;
					}
				}
			}
		}
	}
	return realbound;
}

int main(){
	cin.sync_with_stdio(0); cin.tie(0);
	LL n, m;
	cin >> n >> m;
	// stations 1 to n
	vector<vector<LL> > z;
	for(int i = 0; i < m; i++){
		LL a, b, c;
		cin >> a >> b >> c;
		a--; b--;
		if(a > b) swap(a,b);
		for(int j = 0; j < c; j++){
			z.push_back(vector<LL>({a,b}));
		}
	}
	LL bound = two(z, n);
	cout << bound << '\n';
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	516 KB	Output is correct
5	Correct	2 ms	516 KB	Output is correct
6	Correct	2 ms	516 KB	Output is correct
7	Correct	2 ms	516 KB	Output is correct
8	Correct	3 ms	740 KB	Output is correct
9	Correct	2 ms	740 KB	Output is correct
10	Correct	2 ms	740 KB	Output is correct
11	Correct	2 ms	740 KB	Output is correct
12	Correct	2 ms	740 KB	Output is correct
13	Correct	2 ms	740 KB	Output is correct
14	Correct	2 ms	740 KB	Output is correct
15	Correct	3 ms	740 KB	Output is correct

Subtask #2
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	516 KB	Output is correct
5	Correct	2 ms	516 KB	Output is correct
6	Correct	2 ms	516 KB	Output is correct
7	Correct	2 ms	516 KB	Output is correct
8	Correct	3 ms	740 KB	Output is correct
9	Correct	2 ms	740 KB	Output is correct
10	Correct	2 ms	740 KB	Output is correct
11	Correct	2 ms	740 KB	Output is correct
12	Correct	2 ms	740 KB	Output is correct
13	Correct	2 ms	740 KB	Output is correct
14	Correct	2 ms	740 KB	Output is correct
15	Correct	3 ms	740 KB	Output is correct
16	Correct	4 ms	1252 KB	Output is correct
17	Correct	4 ms	1252 KB	Output is correct
18	Correct	3 ms	1252 KB	Output is correct
19	Correct	3 ms	1256 KB	Output is correct
20	Correct	3 ms	1268 KB	Output is correct
21	Correct	4 ms	1268 KB	Output is correct
22	Correct	3 ms	1268 KB	Output is correct
23	Correct	4 ms	1268 KB	Output is correct
24	Correct	3 ms	1268 KB	Output is correct
25	Correct	2 ms	1268 KB	Output is correct
26	Correct	3 ms	1268 KB	Output is correct
27	Correct	3 ms	1268 KB	Output is correct

Subtask #3
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	516 KB	Output is correct
5	Correct	2 ms	516 KB	Output is correct
6	Correct	2 ms	516 KB	Output is correct
7	Correct	2 ms	516 KB	Output is correct
8	Correct	3 ms	740 KB	Output is correct
9	Correct	2 ms	740 KB	Output is correct
10	Correct	2 ms	740 KB	Output is correct
11	Correct	2 ms	740 KB	Output is correct
12	Correct	2 ms	740 KB	Output is correct
13	Correct	2 ms	740 KB	Output is correct
14	Correct	2 ms	740 KB	Output is correct
15	Correct	3 ms	740 KB	Output is correct
16	Correct	4 ms	1252 KB	Output is correct
17	Correct	4 ms	1252 KB	Output is correct
18	Correct	3 ms	1252 KB	Output is correct
19	Correct	3 ms	1256 KB	Output is correct
20	Correct	3 ms	1268 KB	Output is correct
21	Correct	4 ms	1268 KB	Output is correct
22	Correct	3 ms	1268 KB	Output is correct
23	Correct	4 ms	1268 KB	Output is correct
24	Correct	3 ms	1268 KB	Output is correct
25	Correct	2 ms	1268 KB	Output is correct
26	Correct	3 ms	1268 KB	Output is correct
27	Correct	3 ms	1268 KB	Output is correct
28	Correct	67 ms	47212 KB	Output is correct
29	Correct	64 ms	47236 KB	Output is correct
30	Correct	63 ms	47288 KB	Output is correct
31	Correct	47 ms	47288 KB	Output is correct
32	Correct	49 ms	47288 KB	Output is correct
33	Correct	60 ms	47308 KB	Output is correct
34	Correct	60 ms	47308 KB	Output is correct
35	Correct	65 ms	47308 KB	Output is correct
36	Correct	59 ms	47468 KB	Output is correct
37	Execution timed out	6097 ms	47468 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	516 KB	Output is correct
5	Correct	2 ms	516 KB	Output is correct
6	Correct	2 ms	516 KB	Output is correct
7	Correct	2 ms	516 KB	Output is correct
8	Correct	3 ms	740 KB	Output is correct
9	Correct	2 ms	740 KB	Output is correct
10	Correct	2 ms	740 KB	Output is correct
11	Correct	2 ms	740 KB	Output is correct
12	Correct	2 ms	740 KB	Output is correct
13	Correct	2 ms	740 KB	Output is correct
14	Correct	2 ms	740 KB	Output is correct
15	Correct	3 ms	740 KB	Output is correct
16	Correct	4 ms	1252 KB	Output is correct
17	Correct	4 ms	1252 KB	Output is correct
18	Correct	3 ms	1252 KB	Output is correct
19	Correct	3 ms	1256 KB	Output is correct
20	Correct	3 ms	1268 KB	Output is correct
21	Correct	4 ms	1268 KB	Output is correct
22	Correct	3 ms	1268 KB	Output is correct
23	Correct	4 ms	1268 KB	Output is correct
24	Correct	3 ms	1268 KB	Output is correct
25	Correct	2 ms	1268 KB	Output is correct
26	Correct	3 ms	1268 KB	Output is correct
27	Correct	3 ms	1268 KB	Output is correct
28	Correct	67 ms	47212 KB	Output is correct
29	Correct	64 ms	47236 KB	Output is correct
30	Correct	63 ms	47288 KB	Output is correct
31	Correct	47 ms	47288 KB	Output is correct
32	Correct	49 ms	47288 KB	Output is correct
33	Correct	60 ms	47308 KB	Output is correct
34	Correct	60 ms	47308 KB	Output is correct
35	Correct	65 ms	47308 KB	Output is correct
36	Correct	59 ms	47468 KB	Output is correct
37	Execution timed out	6097 ms	47468 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Subtask #5
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	516 KB	Output is correct
5	Correct	2 ms	516 KB	Output is correct
6	Correct	2 ms	516 KB	Output is correct
7	Correct	2 ms	516 KB	Output is correct
8	Correct	3 ms	740 KB	Output is correct
9	Correct	2 ms	740 KB	Output is correct
10	Correct	2 ms	740 KB	Output is correct
11	Correct	2 ms	740 KB	Output is correct
12	Correct	2 ms	740 KB	Output is correct
13	Correct	2 ms	740 KB	Output is correct
14	Correct	2 ms	740 KB	Output is correct
15	Correct	3 ms	740 KB	Output is correct
16	Correct	4 ms	1252 KB	Output is correct
17	Correct	4 ms	1252 KB	Output is correct
18	Correct	3 ms	1252 KB	Output is correct
19	Correct	3 ms	1256 KB	Output is correct
20	Correct	3 ms	1268 KB	Output is correct
21	Correct	4 ms	1268 KB	Output is correct
22	Correct	3 ms	1268 KB	Output is correct
23	Correct	4 ms	1268 KB	Output is correct
24	Correct	3 ms	1268 KB	Output is correct
25	Correct	2 ms	1268 KB	Output is correct
26	Correct	3 ms	1268 KB	Output is correct
27	Correct	3 ms	1268 KB	Output is correct
28	Correct	67 ms	47212 KB	Output is correct
29	Correct	64 ms	47236 KB	Output is correct
30	Correct	63 ms	47288 KB	Output is correct
31	Correct	47 ms	47288 KB	Output is correct
32	Correct	49 ms	47288 KB	Output is correct
33	Correct	60 ms	47308 KB	Output is correct
34	Correct	60 ms	47308 KB	Output is correct
35	Correct	65 ms	47308 KB	Output is correct
36	Correct	59 ms	47468 KB	Output is correct
37	Execution timed out	6097 ms	47468 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

답안 #55026

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 35.0 / 35.0

Subtask #3 0 / 20.0

Subtask #4 0 / 20.0

Subtask #5 0 / 15.0

Subtask #1
10.0 / 10.0

Subtask #2
35.0 / 35.0

Subtask #3
0 / 20.0

Subtask #4
0 / 20.0

Subtask #5
0 / 15.0