Submission #814421

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
814421	2023-08-08T07:24:48 Z	박상훈(#10120)	Arranging Tickets (JOI17_arranging_tickets)	C++17	10 / 100	286 ms	312 KB

arranging_tickets

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int a[200200], b[200200], c[200200], S[200200];

void add(int l, int r){
	for (int i=l;i<=r;i++) S[i]++;
}

int main(){
	int n, m;
	scanf("%d %d", &n, &m);
	for (int i=1;i<=m;i++){
		scanf("%d %d %d", a+i, b+i, c+i);
		if (a[i] > b[i]) swap(a[i], b[i]);
	}

	int ans = 1e9 + 100;
	for (int z=0;z<(1<<m);z++){
		fill(S+1, S+n+1, 0);

		for (int i=0;i<m;i++){
			if (z&(1<<i)) add(a[i+1], b[i+1]-1);
			else{
				add(1, a[i+1]-1);
				add(b[i+1], n);
			}
		}

		ans = min(ans, *max_element(S+1, S+n+1));
	}

	printf("%d\n", ans);
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:14:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  scanf("%d %d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~~
arranging_tickets.cpp:16:8: 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, c+i);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	202 ms	304 KB	Output is correct
2	Correct	221 ms	300 KB	Output is correct
3	Correct	235 ms	296 KB	Output is correct
4	Correct	204 ms	304 KB	Output is correct
5	Correct	198 ms	300 KB	Output is correct
6	Correct	212 ms	304 KB	Output is correct
7	Correct	208 ms	296 KB	Output is correct
8	Correct	214 ms	308 KB	Output is correct
9	Correct	286 ms	304 KB	Output is correct
10	Correct	204 ms	304 KB	Output is correct
11	Correct	209 ms	300 KB	Output is correct
12	Correct	224 ms	296 KB	Output is correct
13	Correct	230 ms	296 KB	Output is correct
14	Correct	214 ms	296 KB	Output is correct
15	Correct	219 ms	300 KB	Output is correct

Subtask #2

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	202 ms	304 KB	Output is correct
2	Correct	221 ms	300 KB	Output is correct
3	Correct	235 ms	296 KB	Output is correct
4	Correct	204 ms	304 KB	Output is correct
5	Correct	198 ms	300 KB	Output is correct
6	Correct	212 ms	304 KB	Output is correct
7	Correct	208 ms	296 KB	Output is correct
8	Correct	214 ms	308 KB	Output is correct
9	Correct	286 ms	304 KB	Output is correct
10	Correct	204 ms	304 KB	Output is correct
11	Correct	209 ms	300 KB	Output is correct
12	Correct	224 ms	296 KB	Output is correct
13	Correct	230 ms	296 KB	Output is correct
14	Correct	214 ms	296 KB	Output is correct
15	Correct	219 ms	300 KB	Output is correct
16	Incorrect	184 ms	312 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	202 ms	304 KB	Output is correct
2	Correct	221 ms	300 KB	Output is correct
3	Correct	235 ms	296 KB	Output is correct
4	Correct	204 ms	304 KB	Output is correct
5	Correct	198 ms	300 KB	Output is correct
6	Correct	212 ms	304 KB	Output is correct
7	Correct	208 ms	296 KB	Output is correct
8	Correct	214 ms	308 KB	Output is correct
9	Correct	286 ms	304 KB	Output is correct
10	Correct	204 ms	304 KB	Output is correct
11	Correct	209 ms	300 KB	Output is correct
12	Correct	224 ms	296 KB	Output is correct
13	Correct	230 ms	296 KB	Output is correct
14	Correct	214 ms	296 KB	Output is correct
15	Correct	219 ms	300 KB	Output is correct
16	Incorrect	184 ms	312 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	202 ms	304 KB	Output is correct
2	Correct	221 ms	300 KB	Output is correct
3	Correct	235 ms	296 KB	Output is correct
4	Correct	204 ms	304 KB	Output is correct
5	Correct	198 ms	300 KB	Output is correct
6	Correct	212 ms	304 KB	Output is correct
7	Correct	208 ms	296 KB	Output is correct
8	Correct	214 ms	308 KB	Output is correct
9	Correct	286 ms	304 KB	Output is correct
10	Correct	204 ms	304 KB	Output is correct
11	Correct	209 ms	300 KB	Output is correct
12	Correct	224 ms	296 KB	Output is correct
13	Correct	230 ms	296 KB	Output is correct
14	Correct	214 ms	296 KB	Output is correct
15	Correct	219 ms	300 KB	Output is correct
16	Incorrect	184 ms	312 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #5

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	202 ms	304 KB	Output is correct
2	Correct	221 ms	300 KB	Output is correct
3	Correct	235 ms	296 KB	Output is correct
4	Correct	204 ms	304 KB	Output is correct
5	Correct	198 ms	300 KB	Output is correct
6	Correct	212 ms	304 KB	Output is correct
7	Correct	208 ms	296 KB	Output is correct
8	Correct	214 ms	308 KB	Output is correct
9	Correct	286 ms	304 KB	Output is correct
10	Correct	204 ms	304 KB	Output is correct
11	Correct	209 ms	300 KB	Output is correct
12	Correct	224 ms	296 KB	Output is correct
13	Correct	230 ms	296 KB	Output is correct
14	Correct	214 ms	296 KB	Output is correct
15	Correct	219 ms	300 KB	Output is correct
16	Incorrect	184 ms	312 KB	Output isn't correct
17	Halted	0 ms	0 KB	-