Submission #116342

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
116342	2019-06-12T10:03:00 Z	shayan_p	Arranging Tickets (JOI17_arranging_tickets)	C++14	65 / 100	3774 ms	25848 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=80;
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	13 ms	8192 KB	Output is correct
2	Correct	11 ms	8192 KB	Output is correct
3	Correct	12 ms	8192 KB	Output is correct
4	Correct	10 ms	8236 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	8164 KB	Output is correct
8	Correct	11 ms	8192 KB	Output is correct
9	Correct	13 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	13 ms	8192 KB	Output is correct
2	Correct	11 ms	8192 KB	Output is correct
3	Correct	12 ms	8192 KB	Output is correct
4	Correct	10 ms	8236 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	8164 KB	Output is correct
8	Correct	11 ms	8192 KB	Output is correct
9	Correct	13 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	23 ms	8320 KB	Output is correct
17	Correct	23 ms	8292 KB	Output is correct
18	Correct	22 ms	8320 KB	Output is correct
19	Correct	23 ms	8192 KB	Output is correct
20	Correct	24 ms	8288 KB	Output is correct
21	Correct	24 ms	8192 KB	Output is correct
22	Correct	23 ms	8320 KB	Output is correct
23	Correct	23 ms	8292 KB	Output is correct
24	Correct	24 ms	8320 KB	Output is correct
25	Correct	23 ms	8320 KB	Output is correct
26	Correct	24 ms	8332 KB	Output is correct
27	Correct	23 ms	8320 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	8192 KB	Output is correct
2	Correct	11 ms	8192 KB	Output is correct
3	Correct	12 ms	8192 KB	Output is correct
4	Correct	10 ms	8236 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	8164 KB	Output is correct
8	Correct	11 ms	8192 KB	Output is correct
9	Correct	13 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	23 ms	8320 KB	Output is correct
17	Correct	23 ms	8292 KB	Output is correct
18	Correct	22 ms	8320 KB	Output is correct
19	Correct	23 ms	8192 KB	Output is correct
20	Correct	24 ms	8288 KB	Output is correct
21	Correct	24 ms	8192 KB	Output is correct
22	Correct	23 ms	8320 KB	Output is correct
23	Correct	23 ms	8292 KB	Output is correct
24	Correct	24 ms	8320 KB	Output is correct
25	Correct	23 ms	8320 KB	Output is correct
26	Correct	24 ms	8332 KB	Output is correct
27	Correct	23 ms	8320 KB	Output is correct
28	Correct	153 ms	8696 KB	Output is correct
29	Correct	55 ms	8696 KB	Output is correct
30	Correct	56 ms	8696 KB	Output is correct
31	Correct	54 ms	8576 KB	Output is correct
32	Correct	52 ms	8696 KB	Output is correct
33	Correct	54 ms	8952 KB	Output is correct
34	Correct	50 ms	8952 KB	Output is correct
35	Correct	56 ms	9168 KB	Output is correct
36	Correct	53 ms	8952 KB	Output is correct
37	Correct	45 ms	8448 KB	Output is correct
38	Correct	46 ms	8568 KB	Output is correct
39	Correct	45 ms	8448 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	8192 KB	Output is correct
2	Correct	11 ms	8192 KB	Output is correct
3	Correct	12 ms	8192 KB	Output is correct
4	Correct	10 ms	8236 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	8164 KB	Output is correct
8	Correct	11 ms	8192 KB	Output is correct
9	Correct	13 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	23 ms	8320 KB	Output is correct
17	Correct	23 ms	8292 KB	Output is correct
18	Correct	22 ms	8320 KB	Output is correct
19	Correct	23 ms	8192 KB	Output is correct
20	Correct	24 ms	8288 KB	Output is correct
21	Correct	24 ms	8192 KB	Output is correct
22	Correct	23 ms	8320 KB	Output is correct
23	Correct	23 ms	8292 KB	Output is correct
24	Correct	24 ms	8320 KB	Output is correct
25	Correct	23 ms	8320 KB	Output is correct
26	Correct	24 ms	8332 KB	Output is correct
27	Correct	23 ms	8320 KB	Output is correct
28	Correct	153 ms	8696 KB	Output is correct
29	Correct	55 ms	8696 KB	Output is correct
30	Correct	56 ms	8696 KB	Output is correct
31	Correct	54 ms	8576 KB	Output is correct
32	Correct	52 ms	8696 KB	Output is correct
33	Correct	54 ms	8952 KB	Output is correct
34	Correct	50 ms	8952 KB	Output is correct
35	Correct	56 ms	9168 KB	Output is correct
36	Correct	53 ms	8952 KB	Output is correct
37	Correct	45 ms	8448 KB	Output is correct
38	Correct	46 ms	8568 KB	Output is correct
39	Correct	45 ms	8448 KB	Output is correct
40	Correct	3306 ms	25384 KB	Output is correct
41	Correct	3774 ms	25848 KB	Output is correct
42	Correct	3284 ms	25196 KB	Output is correct
43	Incorrect	3387 ms	24956 KB	Output isn't correct
44	Halted	0 ms	0 KB	-

Subtask #5
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	8192 KB	Output is correct
2	Correct	11 ms	8192 KB	Output is correct
3	Correct	12 ms	8192 KB	Output is correct
4	Correct	10 ms	8236 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	8164 KB	Output is correct
8	Correct	11 ms	8192 KB	Output is correct
9	Correct	13 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	23 ms	8320 KB	Output is correct
17	Correct	23 ms	8292 KB	Output is correct
18	Correct	22 ms	8320 KB	Output is correct
19	Correct	23 ms	8192 KB	Output is correct
20	Correct	24 ms	8288 KB	Output is correct
21	Correct	24 ms	8192 KB	Output is correct
22	Correct	23 ms	8320 KB	Output is correct
23	Correct	23 ms	8292 KB	Output is correct
24	Correct	24 ms	8320 KB	Output is correct
25	Correct	23 ms	8320 KB	Output is correct
26	Correct	24 ms	8332 KB	Output is correct
27	Correct	23 ms	8320 KB	Output is correct
28	Correct	153 ms	8696 KB	Output is correct
29	Correct	55 ms	8696 KB	Output is correct
30	Correct	56 ms	8696 KB	Output is correct
31	Correct	54 ms	8576 KB	Output is correct
32	Correct	52 ms	8696 KB	Output is correct
33	Correct	54 ms	8952 KB	Output is correct
34	Correct	50 ms	8952 KB	Output is correct
35	Correct	56 ms	9168 KB	Output is correct
36	Correct	53 ms	8952 KB	Output is correct
37	Correct	45 ms	8448 KB	Output is correct
38	Correct	46 ms	8568 KB	Output is correct
39	Correct	45 ms	8448 KB	Output is correct
40	Correct	3306 ms	25384 KB	Output is correct
41	Correct	3774 ms	25848 KB	Output is correct
42	Correct	3284 ms	25196 KB	Output is correct
43	Incorrect	3387 ms	24956 KB	Output isn't correct
44	Halted	0 ms	0 KB	-

Submission #116342

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