Submission #825630

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
825630	2023-08-15T06:40:29 Z	MohamedAhmed04	Arranging Tickets (JOI17_arranging_tickets)	C++14	10 / 100	384 ms	468 KB

arranging_tickets

#include <bits/stdc++.h>

using namespace std ;

const int MAX = 22 ;

int arr[MAX] ;
int n , m ;

int L[MAX] , R[MAX] , C[MAX] ;

int cnt[MAX] ;

void Apply1(int l , int r , int x)
{
	for(int i = l ; i < r ; ++i)
		cnt[i] += x ;
}

void Apply2(int l , int r , int x)
{
	for(int i = 1 ; i <= n ; ++i)
	{
		if(i < l || i >= r)
			cnt[i] += x ;
		else
			cnt[i] -= x ;
	}
}

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>m ;
	for(int i = 0 ; i < m ; ++i)
	{
		cin>>L[i]>>R[i]>>C[i] ;
		if(L[i] > R[i])
			swap(L[i] , R[i]) ;
	}
	int ans = m ;
	for(int mask = 0 ; mask < (1 << m) ; ++mask)
	{
		memset(cnt , 0 , sizeof(cnt)) ;
		for(int bit = 0 ; bit < m ; ++bit)
		{
			Apply1(L[bit] , R[bit] , C[bit]) ;
			if((mask & (1 << bit)))
				Apply2(L[bit] , R[bit] , C[bit]) ;
		}
		int Max = 0 ;
		for(int i = 1 ; i <= n ; ++i)
			Max = max(Max , cnt[i]) ;
		ans = min(ans , Max) ;
	}
	return cout<<ans<<"\n" , 0 ;
}		

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	384 ms	296 KB	Output is correct
2	Correct	376 ms	292 KB	Output is correct
3	Correct	384 ms	296 KB	Output is correct
4	Correct	362 ms	296 KB	Output is correct
5	Correct	377 ms	296 KB	Output is correct
6	Correct	371 ms	300 KB	Output is correct
7	Correct	381 ms	332 KB	Output is correct
8	Correct	371 ms	292 KB	Output is correct
9	Correct	363 ms	332 KB	Output is correct
10	Correct	372 ms	304 KB	Output is correct
11	Correct	381 ms	304 KB	Output is correct
12	Correct	372 ms	304 KB	Output is correct
13	Correct	373 ms	300 KB	Output is correct
14	Correct	368 ms	300 KB	Output is correct
15	Correct	373 ms	300 KB	Output is correct

Subtask #2

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	384 ms	296 KB	Output is correct
2	Correct	376 ms	292 KB	Output is correct
3	Correct	384 ms	296 KB	Output is correct
4	Correct	362 ms	296 KB	Output is correct
5	Correct	377 ms	296 KB	Output is correct
6	Correct	371 ms	300 KB	Output is correct
7	Correct	381 ms	332 KB	Output is correct
8	Correct	371 ms	292 KB	Output is correct
9	Correct	363 ms	332 KB	Output is correct
10	Correct	372 ms	304 KB	Output is correct
11	Correct	381 ms	304 KB	Output is correct
12	Correct	372 ms	304 KB	Output is correct
13	Correct	373 ms	300 KB	Output is correct
14	Correct	368 ms	300 KB	Output is correct
15	Correct	373 ms	300 KB	Output is correct
16	Runtime error	1 ms	468 KB	Execution killed with signal 11
17	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	384 ms	296 KB	Output is correct
2	Correct	376 ms	292 KB	Output is correct
3	Correct	384 ms	296 KB	Output is correct
4	Correct	362 ms	296 KB	Output is correct
5	Correct	377 ms	296 KB	Output is correct
6	Correct	371 ms	300 KB	Output is correct
7	Correct	381 ms	332 KB	Output is correct
8	Correct	371 ms	292 KB	Output is correct
9	Correct	363 ms	332 KB	Output is correct
10	Correct	372 ms	304 KB	Output is correct
11	Correct	381 ms	304 KB	Output is correct
12	Correct	372 ms	304 KB	Output is correct
13	Correct	373 ms	300 KB	Output is correct
14	Correct	368 ms	300 KB	Output is correct
15	Correct	373 ms	300 KB	Output is correct
16	Runtime error	1 ms	468 KB	Execution killed with signal 11
17	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	384 ms	296 KB	Output is correct
2	Correct	376 ms	292 KB	Output is correct
3	Correct	384 ms	296 KB	Output is correct
4	Correct	362 ms	296 KB	Output is correct
5	Correct	377 ms	296 KB	Output is correct
6	Correct	371 ms	300 KB	Output is correct
7	Correct	381 ms	332 KB	Output is correct
8	Correct	371 ms	292 KB	Output is correct
9	Correct	363 ms	332 KB	Output is correct
10	Correct	372 ms	304 KB	Output is correct
11	Correct	381 ms	304 KB	Output is correct
12	Correct	372 ms	304 KB	Output is correct
13	Correct	373 ms	300 KB	Output is correct
14	Correct	368 ms	300 KB	Output is correct
15	Correct	373 ms	300 KB	Output is correct
16	Runtime error	1 ms	468 KB	Execution killed with signal 11
17	Halted	0 ms	0 KB	-

Subtask #5

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	384 ms	296 KB	Output is correct
2	Correct	376 ms	292 KB	Output is correct
3	Correct	384 ms	296 KB	Output is correct
4	Correct	362 ms	296 KB	Output is correct
5	Correct	377 ms	296 KB	Output is correct
6	Correct	371 ms	300 KB	Output is correct
7	Correct	381 ms	332 KB	Output is correct
8	Correct	371 ms	292 KB	Output is correct
9	Correct	363 ms	332 KB	Output is correct
10	Correct	372 ms	304 KB	Output is correct
11	Correct	381 ms	304 KB	Output is correct
12	Correct	372 ms	304 KB	Output is correct
13	Correct	373 ms	300 KB	Output is correct
14	Correct	368 ms	300 KB	Output is correct
15	Correct	373 ms	300 KB	Output is correct
16	Runtime error	1 ms	468 KB	Execution killed with signal 11
17	Halted	0 ms	0 KB	-