Submission #116339

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
116339	2019-06-12T09:59:31 Z	shayan_p	Arranging Tickets (JOI17_arranging_tickets)	C++14	100 / 100	5841 ms	45052 KB

arranging_tickets

// High above the clouds there is a rainbow...

#include<bits/stdc++.h>

#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,ll> pil;

const int maxn=2e5+10,SQ=100;
const ll inf=1e18;

int a[maxn],b[maxn],_a[maxn],_b[maxn];
ll c[maxn],arr[maxn],arr2[maxn];

int pp[maxn];

vector<pil>v[maxn];
priority_queue<pil> pq;

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);

    srand(time(0));
    
    int n,m; cin>>n>>m;
    for(int i=0;i<m;i++){
	cin>>_a[i]>>_b[i]>>c[i], --_a[i],--_b[i];
    }
    for(int i=0;i<n;i++){
	pp[i]=i;
    }
    random_shuffle(pp,pp+n);

    ll ans=inf;
    
    for(int w=0;w<min(SQ,n);w++){
	
	memset(arr,0,sizeof arr);
	memset(arr2,0,sizeof arr2);
	for(int i=0;i<n;i++){
	    v[i].clear();
	}
	while(sz(pq)){
	    pq.pop();
	}
	
	for(int i=0;i<m;i++){
	    a[i]=(_a[i]+pp[w])%n, b[i]=(_b[i]+pp[w])%n;
	    if(a[i]>b[i]) swap(a[i],b[i]);
	    v[a[i]].PB({b[i],c[i]});
	    arr[a[i]]+=c[i], arr[b[i]]-=c[i];
	}
	for(int i=1;i<n;i++){
	    arr[i]+=arr[i-1];
	}
	for(int i=0;i<n;i++){
	    arr[i]=(1+arr[i])/2;
	}
	
	ll cnt=0,nw=0;
	for(int i=0;i<n;i++){
	    for(auto x:v[i]){
		pq.push(x);	
	    }
	    nw+=arr2[i];
	    
	    while(arr[i]-nw>0){
		pil x=pq.top();
		pq.pop();
		
		ll num= min(arr[i]-nw,x.S);
		x.S-=num, nw+=num, arr2[x.F]-=num, cnt+=num;
		if(x.S>0) pq.push(x);
	    }
	}

	ans=min(ans,cnt);
    }
    return cout<<ans<<endl,0;
}
// Deathly mistakes:
//  * Read the problem curfully.
//  * Check maxn.
//  * Overflows.

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	8192 KB	Output is correct
2	Correct	12 ms	8192 KB	Output is correct
3	Correct	11 ms	8192 KB	Output is correct
4	Correct	12 ms	8192 KB	Output is correct
5	Correct	12 ms	8192 KB	Output is correct
6	Correct	11 ms	8192 KB	Output is correct
7	Correct	11 ms	8192 KB	Output is correct
8	Correct	12 ms	8192 KB	Output is correct
9	Correct	11 ms	8192 KB	Output is correct
10	Correct	11 ms	8192 KB	Output is correct
11	Correct	11 ms	8192 KB	Output is correct
12	Correct	12 ms	8192 KB	Output is correct
13	Correct	11 ms	8192 KB	Output is correct
14	Correct	11 ms	8192 KB	Output is correct
15	Correct	11 ms	8192 KB	Output is correct

Subtask #2
35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	8192 KB	Output is correct
2	Correct	12 ms	8192 KB	Output is correct
3	Correct	11 ms	8192 KB	Output is correct
4	Correct	12 ms	8192 KB	Output is correct
5	Correct	12 ms	8192 KB	Output is correct
6	Correct	11 ms	8192 KB	Output is correct
7	Correct	11 ms	8192 KB	Output is correct
8	Correct	12 ms	8192 KB	Output is correct
9	Correct	11 ms	8192 KB	Output is correct
10	Correct	11 ms	8192 KB	Output is correct
11	Correct	11 ms	8192 KB	Output is correct
12	Correct	12 ms	8192 KB	Output is correct
13	Correct	11 ms	8192 KB	Output is correct
14	Correct	11 ms	8192 KB	Output is correct
15	Correct	11 ms	8192 KB	Output is correct
16	Correct	25 ms	8192 KB	Output is correct
17	Correct	27 ms	8192 KB	Output is correct
18	Correct	29 ms	8320 KB	Output is correct
19	Correct	27 ms	8320 KB	Output is correct
20	Correct	28 ms	8320 KB	Output is correct
21	Correct	27 ms	8320 KB	Output is correct
22	Correct	26 ms	8320 KB	Output is correct
23	Correct	28 ms	8440 KB	Output is correct
24	Correct	27 ms	8320 KB	Output is correct
25	Correct	28 ms	8320 KB	Output is correct
26	Correct	28 ms	8336 KB	Output is correct
27	Correct	28 ms	8320 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	8192 KB	Output is correct
2	Correct	12 ms	8192 KB	Output is correct
3	Correct	11 ms	8192 KB	Output is correct
4	Correct	12 ms	8192 KB	Output is correct
5	Correct	12 ms	8192 KB	Output is correct
6	Correct	11 ms	8192 KB	Output is correct
7	Correct	11 ms	8192 KB	Output is correct
8	Correct	12 ms	8192 KB	Output is correct
9	Correct	11 ms	8192 KB	Output is correct
10	Correct	11 ms	8192 KB	Output is correct
11	Correct	11 ms	8192 KB	Output is correct
12	Correct	12 ms	8192 KB	Output is correct
13	Correct	11 ms	8192 KB	Output is correct
14	Correct	11 ms	8192 KB	Output is correct
15	Correct	11 ms	8192 KB	Output is correct
16	Correct	25 ms	8192 KB	Output is correct
17	Correct	27 ms	8192 KB	Output is correct
18	Correct	29 ms	8320 KB	Output is correct
19	Correct	27 ms	8320 KB	Output is correct
20	Correct	28 ms	8320 KB	Output is correct
21	Correct	27 ms	8320 KB	Output is correct
22	Correct	26 ms	8320 KB	Output is correct
23	Correct	28 ms	8440 KB	Output is correct
24	Correct	27 ms	8320 KB	Output is correct
25	Correct	28 ms	8320 KB	Output is correct
26	Correct	28 ms	8336 KB	Output is correct
27	Correct	28 ms	8320 KB	Output is correct
28	Correct	67 ms	8660 KB	Output is correct
29	Correct	66 ms	8736 KB	Output is correct
30	Correct	67 ms	8700 KB	Output is correct
31	Correct	65 ms	8952 KB	Output is correct
32	Correct	65 ms	9336 KB	Output is correct
33	Correct	66 ms	9124 KB	Output is correct
34	Correct	64 ms	9080 KB	Output is correct
35	Correct	70 ms	9468 KB	Output is correct
36	Correct	64 ms	8952 KB	Output is correct
37	Correct	55 ms	8448 KB	Output is correct
38	Correct	57 ms	8448 KB	Output is correct
39	Correct	52 ms	8448 KB	Output is correct

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	8192 KB	Output is correct
2	Correct	12 ms	8192 KB	Output is correct
3	Correct	11 ms	8192 KB	Output is correct
4	Correct	12 ms	8192 KB	Output is correct
5	Correct	12 ms	8192 KB	Output is correct
6	Correct	11 ms	8192 KB	Output is correct
7	Correct	11 ms	8192 KB	Output is correct
8	Correct	12 ms	8192 KB	Output is correct
9	Correct	11 ms	8192 KB	Output is correct
10	Correct	11 ms	8192 KB	Output is correct
11	Correct	11 ms	8192 KB	Output is correct
12	Correct	12 ms	8192 KB	Output is correct
13	Correct	11 ms	8192 KB	Output is correct
14	Correct	11 ms	8192 KB	Output is correct
15	Correct	11 ms	8192 KB	Output is correct
16	Correct	25 ms	8192 KB	Output is correct
17	Correct	27 ms	8192 KB	Output is correct
18	Correct	29 ms	8320 KB	Output is correct
19	Correct	27 ms	8320 KB	Output is correct
20	Correct	28 ms	8320 KB	Output is correct
21	Correct	27 ms	8320 KB	Output is correct
22	Correct	26 ms	8320 KB	Output is correct
23	Correct	28 ms	8440 KB	Output is correct
24	Correct	27 ms	8320 KB	Output is correct
25	Correct	28 ms	8320 KB	Output is correct
26	Correct	28 ms	8336 KB	Output is correct
27	Correct	28 ms	8320 KB	Output is correct
28	Correct	67 ms	8660 KB	Output is correct
29	Correct	66 ms	8736 KB	Output is correct
30	Correct	67 ms	8700 KB	Output is correct
31	Correct	65 ms	8952 KB	Output is correct
32	Correct	65 ms	9336 KB	Output is correct
33	Correct	66 ms	9124 KB	Output is correct
34	Correct	64 ms	9080 KB	Output is correct
35	Correct	70 ms	9468 KB	Output is correct
36	Correct	64 ms	8952 KB	Output is correct
37	Correct	55 ms	8448 KB	Output is correct
38	Correct	57 ms	8448 KB	Output is correct
39	Correct	52 ms	8448 KB	Output is correct
40	Correct	4481 ms	27504 KB	Output is correct
41	Correct	4547 ms	29012 KB	Output is correct
42	Correct	4580 ms	30608 KB	Output is correct
43	Correct	4050 ms	39264 KB	Output is correct
44	Correct	4204 ms	37176 KB	Output is correct
45	Correct	4371 ms	45052 KB	Output is correct
46	Correct	4217 ms	29252 KB	Output is correct
47	Correct	4046 ms	28884 KB	Output is correct
48	Correct	4244 ms	29848 KB	Output is correct
49	Correct	2761 ms	16244 KB	Output is correct
50	Correct	3241 ms	17492 KB	Output is correct
51	Correct	2893 ms	17260 KB	Output is correct

Subtask #5
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	8192 KB	Output is correct
2	Correct	12 ms	8192 KB	Output is correct
3	Correct	11 ms	8192 KB	Output is correct
4	Correct	12 ms	8192 KB	Output is correct
5	Correct	12 ms	8192 KB	Output is correct
6	Correct	11 ms	8192 KB	Output is correct
7	Correct	11 ms	8192 KB	Output is correct
8	Correct	12 ms	8192 KB	Output is correct
9	Correct	11 ms	8192 KB	Output is correct
10	Correct	11 ms	8192 KB	Output is correct
11	Correct	11 ms	8192 KB	Output is correct
12	Correct	12 ms	8192 KB	Output is correct
13	Correct	11 ms	8192 KB	Output is correct
14	Correct	11 ms	8192 KB	Output is correct
15	Correct	11 ms	8192 KB	Output is correct
16	Correct	25 ms	8192 KB	Output is correct
17	Correct	27 ms	8192 KB	Output is correct
18	Correct	29 ms	8320 KB	Output is correct
19	Correct	27 ms	8320 KB	Output is correct
20	Correct	28 ms	8320 KB	Output is correct
21	Correct	27 ms	8320 KB	Output is correct
22	Correct	26 ms	8320 KB	Output is correct
23	Correct	28 ms	8440 KB	Output is correct
24	Correct	27 ms	8320 KB	Output is correct
25	Correct	28 ms	8320 KB	Output is correct
26	Correct	28 ms	8336 KB	Output is correct
27	Correct	28 ms	8320 KB	Output is correct
28	Correct	67 ms	8660 KB	Output is correct
29	Correct	66 ms	8736 KB	Output is correct
30	Correct	67 ms	8700 KB	Output is correct
31	Correct	65 ms	8952 KB	Output is correct
32	Correct	65 ms	9336 KB	Output is correct
33	Correct	66 ms	9124 KB	Output is correct
34	Correct	64 ms	9080 KB	Output is correct
35	Correct	70 ms	9468 KB	Output is correct
36	Correct	64 ms	8952 KB	Output is correct
37	Correct	55 ms	8448 KB	Output is correct
38	Correct	57 ms	8448 KB	Output is correct
39	Correct	52 ms	8448 KB	Output is correct
40	Correct	4481 ms	27504 KB	Output is correct
41	Correct	4547 ms	29012 KB	Output is correct
42	Correct	4580 ms	30608 KB	Output is correct
43	Correct	4050 ms	39264 KB	Output is correct
44	Correct	4204 ms	37176 KB	Output is correct
45	Correct	4371 ms	45052 KB	Output is correct
46	Correct	4217 ms	29252 KB	Output is correct
47	Correct	4046 ms	28884 KB	Output is correct
48	Correct	4244 ms	29848 KB	Output is correct
49	Correct	2761 ms	16244 KB	Output is correct
50	Correct	3241 ms	17492 KB	Output is correct
51	Correct	2893 ms	17260 KB	Output is correct
52	Correct	5252 ms	30324 KB	Output is correct
53	Correct	5483 ms	30680 KB	Output is correct
54	Correct	5841 ms	29596 KB	Output is correct
55	Correct	4974 ms	38604 KB	Output is correct
56	Correct	4968 ms	41776 KB	Output is correct
57	Correct	5018 ms	29680 KB	Output is correct
58	Correct	5173 ms	29496 KB	Output is correct
59	Correct	2892 ms	17008 KB	Output is correct

Submission #116339

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 35.0 / 35.0

Subtask #3 20.0 / 20.0

Subtask #4 20.0 / 20.0

Subtask #5 15.0 / 15.0

Subtask #1
10.0 / 10.0

Subtask #2
35.0 / 35.0

Subtask #3
20.0 / 20.0

Subtask #4
20.0 / 20.0

Subtask #5
15.0 / 15.0