oj.uz

답안 #116337

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
116337 2019-06-12T09:57:35 Z shayan_p Arranging Tickets (JOI17_arranging_tickets) C++14
65 / 100
 6000 ms 29548 KB 
// 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=700;
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

# 결과 실행 시간 메모리 Grader output
1 Correct 12 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 12 ms 8192 KB Output is correct
5 Correct 11 ms 8192 KB Output is correct
6 Correct 11 ms 8192 KB Output is correct
7 Correct 12 ms 8320 KB Output is correct
8 Correct 11 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 10 ms 8192 KB Output is correct
13 Correct 15 ms 8192 KB Output is correct
14 Correct 12 ms 8192 KB Output is correct
15 Correct 11 ms 8192 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 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 12 ms 8192 KB Output is correct
5 Correct 11 ms 8192 KB Output is correct
6 Correct 11 ms 8192 KB Output is correct
7 Correct 12 ms 8320 KB Output is correct
8 Correct 11 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 10 ms 8192 KB Output is correct
13 Correct 15 ms 8192 KB Output is correct
14 Correct 12 ms 8192 KB Output is correct
15 Correct 11 ms 8192 KB Output is correct
16 Correct 61 ms 8336 KB Output is correct
17 Correct 62 ms 8320 KB Output is correct
18 Correct 63 ms 8440 KB Output is correct
19 Correct 62 ms 8440 KB Output is correct
20 Correct 59 ms 8408 KB Output is correct
21 Correct 60 ms 8320 KB Output is correct
22 Correct 64 ms 8440 KB Output is correct
23 Correct 63 ms 8192 KB Output is correct
24 Correct 66 ms 8440 KB Output is correct
25 Correct 64 ms 8448 KB Output is correct
26 Correct 59 ms 8320 KB Output is correct
27 Correct 65 ms 8440 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 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 12 ms 8192 KB Output is correct
5 Correct 11 ms 8192 KB Output is correct
6 Correct 11 ms 8192 KB Output is correct
7 Correct 12 ms 8320 KB Output is correct
8 Correct 11 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 10 ms 8192 KB Output is correct
13 Correct 15 ms 8192 KB Output is correct
14 Correct 12 ms 8192 KB Output is correct
15 Correct 11 ms 8192 KB Output is correct
16 Correct 61 ms 8336 KB Output is correct
17 Correct 62 ms 8320 KB Output is correct
18 Correct 63 ms 8440 KB Output is correct
19 Correct 62 ms 8440 KB Output is correct
20 Correct 59 ms 8408 KB Output is correct
21 Correct 60 ms 8320 KB Output is correct
22 Correct 64 ms 8440 KB Output is correct
23 Correct 63 ms 8192 KB Output is correct
24 Correct 66 ms 8440 KB Output is correct
25 Correct 64 ms 8448 KB Output is correct
26 Correct 59 ms 8320 KB Output is correct
27 Correct 65 ms 8440 KB Output is correct
28 Correct 387 ms 8932 KB Output is correct
29 Correct 391 ms 8952 KB Output is correct
30 Correct 409 ms 8824 KB Output is correct
31 Correct 391 ms 9212 KB Output is correct
32 Correct 437 ms 9660 KB Output is correct
33 Correct 406 ms 11572 KB Output is correct
34 Correct 379 ms 11512 KB Output is correct
35 Correct 395 ms 14328 KB Output is correct
36 Correct 394 ms 11532 KB Output is correct
37 Correct 331 ms 8572 KB Output is correct
38 Correct 326 ms 8448 KB Output is correct
39 Correct 331 ms 8544 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 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 12 ms 8192 KB Output is correct
5 Correct 11 ms 8192 KB Output is correct
6 Correct 11 ms 8192 KB Output is correct
7 Correct 12 ms 8320 KB Output is correct
8 Correct 11 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 10 ms 8192 KB Output is correct
13 Correct 15 ms 8192 KB Output is correct
14 Correct 12 ms 8192 KB Output is correct
15 Correct 11 ms 8192 KB Output is correct
16 Correct 61 ms 8336 KB Output is correct
17 Correct 62 ms 8320 KB Output is correct
18 Correct 63 ms 8440 KB Output is correct
19 Correct 62 ms 8440 KB Output is correct
20 Correct 59 ms 8408 KB Output is correct
21 Correct 60 ms 8320 KB Output is correct
22 Correct 64 ms 8440 KB Output is correct
23 Correct 63 ms 8192 KB Output is correct
24 Correct 66 ms 8440 KB Output is correct
25 Correct 64 ms 8448 KB Output is correct
26 Correct 59 ms 8320 KB Output is correct
27 Correct 65 ms 8440 KB Output is correct
28 Correct 387 ms 8932 KB Output is correct
29 Correct 391 ms 8952 KB Output is correct
30 Correct 409 ms 8824 KB Output is correct
31 Correct 391 ms 9212 KB Output is correct
32 Correct 437 ms 9660 KB Output is correct
33 Correct 406 ms 11572 KB Output is correct
34 Correct 379 ms 11512 KB Output is correct
35 Correct 395 ms 14328 KB Output is correct
36 Correct 394 ms 11532 KB Output is correct
37 Correct 331 ms 8572 KB Output is correct
38 Correct 326 ms 8448 KB Output is correct
39 Correct 331 ms 8544 KB Output is correct
40 Execution timed out 6043 ms 29548 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 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 12 ms 8192 KB Output is correct
5 Correct 11 ms 8192 KB Output is correct
6 Correct 11 ms 8192 KB Output is correct
7 Correct 12 ms 8320 KB Output is correct
8 Correct 11 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 10 ms 8192 KB Output is correct
13 Correct 15 ms 8192 KB Output is correct
14 Correct 12 ms 8192 KB Output is correct
15 Correct 11 ms 8192 KB Output is correct
16 Correct 61 ms 8336 KB Output is correct
17 Correct 62 ms 8320 KB Output is correct
18 Correct 63 ms 8440 KB Output is correct
19 Correct 62 ms 8440 KB Output is correct
20 Correct 59 ms 8408 KB Output is correct
21 Correct 60 ms 8320 KB Output is correct
22 Correct 64 ms 8440 KB Output is correct
23 Correct 63 ms 8192 KB Output is correct
24 Correct 66 ms 8440 KB Output is correct
25 Correct 64 ms 8448 KB Output is correct
26 Correct 59 ms 8320 KB Output is correct
27 Correct 65 ms 8440 KB Output is correct
28 Correct 387 ms 8932 KB Output is correct
29 Correct 391 ms 8952 KB Output is correct
30 Correct 409 ms 8824 KB Output is correct
31 Correct 391 ms 9212 KB Output is correct
32 Correct 437 ms 9660 KB Output is correct
33 Correct 406 ms 11572 KB Output is correct
34 Correct 379 ms 11512 KB Output is correct
35 Correct 395 ms 14328 KB Output is correct
36 Correct 394 ms 11532 KB Output is correct
37 Correct 331 ms 8572 KB Output is correct
38 Correct 326 ms 8448 KB Output is correct
39 Correct 331 ms 8544 KB Output is correct
40 Execution timed out 6043 ms 29548 KB Time limit exceeded
41 Halted 0 ms 0 KB -