Submission #116338

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
116338	2019-06-12T09:58:30 Z	shayan_p	Arranging Tickets (JOI17_arranging_tickets)	C++14	65 / 100	6000 ms	27996 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=300;
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	11 ms	8192 KB	Output is correct
5	Correct	11 ms	8192 KB	Output is correct
6	Correct	12 ms	8192 KB	Output is correct
7	Correct	11 ms	8192 KB	Output is correct
8	Correct	11 ms	8192 KB	Output is correct
9	Correct	12 ms	8192 KB	Output is correct
10	Correct	11 ms	8192 KB	Output is correct
11	Correct	12 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	12 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	11 ms	8192 KB	Output is correct
5	Correct	11 ms	8192 KB	Output is correct
6	Correct	12 ms	8192 KB	Output is correct
7	Correct	11 ms	8192 KB	Output is correct
8	Correct	11 ms	8192 KB	Output is correct
9	Correct	12 ms	8192 KB	Output is correct
10	Correct	11 ms	8192 KB	Output is correct
11	Correct	12 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	12 ms	8192 KB	Output is correct
16	Correct	60 ms	8300 KB	Output is correct
17	Correct	64 ms	8320 KB	Output is correct
18	Correct	64 ms	8320 KB	Output is correct
19	Correct	61 ms	8320 KB	Output is correct
20	Correct	64 ms	8440 KB	Output is correct
21	Correct	64 ms	8320 KB	Output is correct
22	Correct	63 ms	8320 KB	Output is correct
23	Correct	60 ms	8440 KB	Output is correct
24	Correct	63 ms	8320 KB	Output is correct
25	Correct	59 ms	8320 KB	Output is correct
26	Correct	59 ms	8292 KB	Output is correct
27	Correct	62 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	11 ms	8192 KB	Output is correct
5	Correct	11 ms	8192 KB	Output is correct
6	Correct	12 ms	8192 KB	Output is correct
7	Correct	11 ms	8192 KB	Output is correct
8	Correct	11 ms	8192 KB	Output is correct
9	Correct	12 ms	8192 KB	Output is correct
10	Correct	11 ms	8192 KB	Output is correct
11	Correct	12 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	12 ms	8192 KB	Output is correct
16	Correct	60 ms	8300 KB	Output is correct
17	Correct	64 ms	8320 KB	Output is correct
18	Correct	64 ms	8320 KB	Output is correct
19	Correct	61 ms	8320 KB	Output is correct
20	Correct	64 ms	8440 KB	Output is correct
21	Correct	64 ms	8320 KB	Output is correct
22	Correct	63 ms	8320 KB	Output is correct
23	Correct	60 ms	8440 KB	Output is correct
24	Correct	63 ms	8320 KB	Output is correct
25	Correct	59 ms	8320 KB	Output is correct
26	Correct	59 ms	8292 KB	Output is correct
27	Correct	62 ms	8320 KB	Output is correct
28	Correct	171 ms	8696 KB	Output is correct
29	Correct	176 ms	8956 KB	Output is correct
30	Correct	185 ms	8836 KB	Output is correct
31	Correct	187 ms	9208 KB	Output is correct
32	Correct	182 ms	9532 KB	Output is correct
33	Correct	182 ms	9848 KB	Output is correct
34	Correct	171 ms	9976 KB	Output is correct
35	Correct	283 ms	11128 KB	Output is correct
36	Correct	181 ms	9848 KB	Output is correct
37	Correct	141 ms	8448 KB	Output is correct
38	Correct	149 ms	8524 KB	Output is correct
39	Correct	147 ms	8536 KB	Output is correct

Subtask #4
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	11 ms	8192 KB	Output is correct
5	Correct	11 ms	8192 KB	Output is correct
6	Correct	12 ms	8192 KB	Output is correct
7	Correct	11 ms	8192 KB	Output is correct
8	Correct	11 ms	8192 KB	Output is correct
9	Correct	12 ms	8192 KB	Output is correct
10	Correct	11 ms	8192 KB	Output is correct
11	Correct	12 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	12 ms	8192 KB	Output is correct
16	Correct	60 ms	8300 KB	Output is correct
17	Correct	64 ms	8320 KB	Output is correct
18	Correct	64 ms	8320 KB	Output is correct
19	Correct	61 ms	8320 KB	Output is correct
20	Correct	64 ms	8440 KB	Output is correct
21	Correct	64 ms	8320 KB	Output is correct
22	Correct	63 ms	8320 KB	Output is correct
23	Correct	60 ms	8440 KB	Output is correct
24	Correct	63 ms	8320 KB	Output is correct
25	Correct	59 ms	8320 KB	Output is correct
26	Correct	59 ms	8292 KB	Output is correct
27	Correct	62 ms	8320 KB	Output is correct
28	Correct	171 ms	8696 KB	Output is correct
29	Correct	176 ms	8956 KB	Output is correct
30	Correct	185 ms	8836 KB	Output is correct
31	Correct	187 ms	9208 KB	Output is correct
32	Correct	182 ms	9532 KB	Output is correct
33	Correct	182 ms	9848 KB	Output is correct
34	Correct	171 ms	9976 KB	Output is correct
35	Correct	283 ms	11128 KB	Output is correct
36	Correct	181 ms	9848 KB	Output is correct
37	Correct	141 ms	8448 KB	Output is correct
38	Correct	149 ms	8524 KB	Output is correct
39	Correct	147 ms	8536 KB	Output is correct
40	Execution timed out	6008 ms	27996 KB	Time limit exceeded
41	Halted	0 ms	0 KB	-

Subtask #5
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	11 ms	8192 KB	Output is correct
5	Correct	11 ms	8192 KB	Output is correct
6	Correct	12 ms	8192 KB	Output is correct
7	Correct	11 ms	8192 KB	Output is correct
8	Correct	11 ms	8192 KB	Output is correct
9	Correct	12 ms	8192 KB	Output is correct
10	Correct	11 ms	8192 KB	Output is correct
11	Correct	12 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	12 ms	8192 KB	Output is correct
16	Correct	60 ms	8300 KB	Output is correct
17	Correct	64 ms	8320 KB	Output is correct
18	Correct	64 ms	8320 KB	Output is correct
19	Correct	61 ms	8320 KB	Output is correct
20	Correct	64 ms	8440 KB	Output is correct
21	Correct	64 ms	8320 KB	Output is correct
22	Correct	63 ms	8320 KB	Output is correct
23	Correct	60 ms	8440 KB	Output is correct
24	Correct	63 ms	8320 KB	Output is correct
25	Correct	59 ms	8320 KB	Output is correct
26	Correct	59 ms	8292 KB	Output is correct
27	Correct	62 ms	8320 KB	Output is correct
28	Correct	171 ms	8696 KB	Output is correct
29	Correct	176 ms	8956 KB	Output is correct
30	Correct	185 ms	8836 KB	Output is correct
31	Correct	187 ms	9208 KB	Output is correct
32	Correct	182 ms	9532 KB	Output is correct
33	Correct	182 ms	9848 KB	Output is correct
34	Correct	171 ms	9976 KB	Output is correct
35	Correct	283 ms	11128 KB	Output is correct
36	Correct	181 ms	9848 KB	Output is correct
37	Correct	141 ms	8448 KB	Output is correct
38	Correct	149 ms	8524 KB	Output is correct
39	Correct	147 ms	8536 KB	Output is correct
40	Execution timed out	6008 ms	27996 KB	Time limit exceeded
41	Halted	0 ms	0 KB	-

Submission #116338

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 35.0 / 35.0

Subtask #3 20.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
20.0 / 20.0

Subtask #4
0 / 20.0

Subtask #5
0 / 15.0