Submission #116140

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
116140	2019-06-10T19:29:21 Z	shayan_p	Arranging Tickets (JOI17_arranging_tickets)	C++14	65 / 100	1033 ms	6608 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;
 
const int maxn=3010,mod=1e9+7;
const ll inf=1e18;
 
int a[maxn],b[maxn],n,m;
ll c[maxn],val[maxn];
 
ll solve(){
    ll ans=inf;
    for(int msk=0;msk<(1<<m);msk++){
	memset(val,0,sizeof val);
	for(int i=0;i<m;i++){
	    if(bit(msk,i)){
		for(int j=a[i];j!=b[i];j=(j+1)%n){
		    val[j]+=c[i];
		}
	    }
	    else{
		for(int j=b[i];j!=a[i];j=(j+1)%n){
		    val[j]+=c[i];
		}
	    }	 
	}
	ll mx=0;
	for(int i=0;i<n;i++){
	    mx=max(mx,val[i]);
	}
	ans=min(ans,mx);
    }
    return ans;
}
void print(){
    cout<<n<<" "<<m<<endl;
    for(int i=0;i<m;i++){
	cout<<a[i]<<" "<<b[i]<<" "<<c[i]<<endl;
    }
}
 
int arr[maxn],arr2[maxn];
vector<int>v[maxn];
priority_queue<int>pq;
 
ll solve2(){
    memset(arr,0,sizeof arr);
    memset(arr2,0,sizeof arr2);
    
    for(int i=0;i<n;i++){
	v[i].clear();
    }
    
    for(int i=0;i<m;i++){
	int A=a[i],B=b[i];
	if(A>B) swap(A,B);
	arr[A]++, arr[B]--, v[A].PB(B);
    }
    int sm=0;
    for(int i=0;i<n;i++){
	sm+=arr[i];
	arr[i]= (sm+1)/2;
    }

    while(sz(pq)) pq.pop();
    
    int ans=0;
    sm=0;
    for(int i=0;i<n;i++){
	for(int x:v[i])
	    pq.push(x);
	while(sm+arr2[i]+arr[i]>0){
	    if(pq.empty() || pq.top()<i) assert(0);
	    int x=pq.top();
	    pq.pop();
	    ans++, arr2[i]--, arr2[x]++;
	}
	sm+=arr2[i];
    }
    return ans;
}
 
int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
 
    cin>>n>>m;
    for(int i=0;i<m;i++)
	cin>>a[i]>>b[i]>>c[i], --a[i],--b[i];
 
    ll ans=inf;
    for(int i=0;i<n;i++){
	ans=min(ans,solve2());
	for(int j=0;j<m;j++)
	    a[j]=(a[j]+1)%n, b[j]=(b[j]+1)%n;
    }
 
    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	2 ms	512 KB	Output is correct
2	Correct	2 ms	512 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	3 ms	512 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct
10	Correct	2 ms	512 KB	Output is correct
11	Correct	2 ms	512 KB	Output is correct
12	Correct	2 ms	512 KB	Output is correct
13	Correct	2 ms	512 KB	Output is correct
14	Correct	2 ms	512 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct

Subtask #2
35.0 / 35.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	512 KB	Output is correct
2	Correct	2 ms	512 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	3 ms	512 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct
10	Correct	2 ms	512 KB	Output is correct
11	Correct	2 ms	512 KB	Output is correct
12	Correct	2 ms	512 KB	Output is correct
13	Correct	2 ms	512 KB	Output is correct
14	Correct	2 ms	512 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	9 ms	512 KB	Output is correct
17	Correct	12 ms	512 KB	Output is correct
18	Correct	10 ms	512 KB	Output is correct
19	Correct	10 ms	512 KB	Output is correct
20	Correct	12 ms	512 KB	Output is correct
21	Correct	10 ms	512 KB	Output is correct
22	Correct	10 ms	384 KB	Output is correct
23	Correct	10 ms	512 KB	Output is correct
24	Correct	9 ms	536 KB	Output is correct
25	Correct	9 ms	512 KB	Output is correct
26	Correct	9 ms	512 KB	Output is correct
27	Correct	10 ms	512 KB	Output is correct
28	Correct	1012 ms	868 KB	Output is correct
29	Correct	1033 ms	876 KB	Output is correct
30	Correct	1016 ms	896 KB	Output is correct
31	Correct	1030 ms	788 KB	Output is correct
32	Correct	986 ms	1116 KB	Output is correct
33	Correct	984 ms	3704 KB	Output is correct
34	Correct	973 ms	3832 KB	Output is correct
35	Correct	1025 ms	6608 KB	Output is correct
36	Correct	974 ms	3588 KB	Output is correct
37	Correct	767 ms	640 KB	Output is correct
38	Correct	777 ms	640 KB	Output is correct
39	Correct	778 ms	640 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	512 KB	Output is correct
2	Correct	2 ms	512 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	3 ms	512 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct
10	Correct	2 ms	512 KB	Output is correct
11	Correct	2 ms	512 KB	Output is correct
12	Correct	2 ms	512 KB	Output is correct
13	Correct	2 ms	512 KB	Output is correct
14	Correct	2 ms	512 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	9 ms	512 KB	Output is correct
17	Correct	12 ms	512 KB	Output is correct
18	Correct	10 ms	512 KB	Output is correct
19	Correct	10 ms	512 KB	Output is correct
20	Correct	12 ms	512 KB	Output is correct
21	Correct	10 ms	512 KB	Output is correct
22	Correct	10 ms	384 KB	Output is correct
23	Correct	10 ms	512 KB	Output is correct
24	Correct	9 ms	536 KB	Output is correct
25	Correct	9 ms	512 KB	Output is correct
26	Correct	9 ms	512 KB	Output is correct
27	Correct	10 ms	512 KB	Output is correct
28	Correct	1012 ms	868 KB	Output is correct
29	Correct	1033 ms	876 KB	Output is correct
30	Correct	1016 ms	896 KB	Output is correct
31	Correct	1030 ms	788 KB	Output is correct
32	Correct	986 ms	1116 KB	Output is correct
33	Correct	984 ms	3704 KB	Output is correct
34	Correct	973 ms	3832 KB	Output is correct
35	Correct	1025 ms	6608 KB	Output is correct
36	Correct	974 ms	3588 KB	Output is correct
37	Correct	767 ms	640 KB	Output is correct
38	Correct	777 ms	640 KB	Output is correct
39	Correct	778 ms	640 KB	Output is correct
40	Incorrect	3 ms	512 KB	Output isn't correct
41	Halted	0 ms	0 KB	-

Subtask #5
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	512 KB	Output is correct
2	Correct	2 ms	512 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	3 ms	512 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct
10	Correct	2 ms	512 KB	Output is correct
11	Correct	2 ms	512 KB	Output is correct
12	Correct	2 ms	512 KB	Output is correct
13	Correct	2 ms	512 KB	Output is correct
14	Correct	2 ms	512 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	9 ms	512 KB	Output is correct
17	Correct	12 ms	512 KB	Output is correct
18	Correct	10 ms	512 KB	Output is correct
19	Correct	10 ms	512 KB	Output is correct
20	Correct	12 ms	512 KB	Output is correct
21	Correct	10 ms	512 KB	Output is correct
22	Correct	10 ms	384 KB	Output is correct
23	Correct	10 ms	512 KB	Output is correct
24	Correct	9 ms	536 KB	Output is correct
25	Correct	9 ms	512 KB	Output is correct
26	Correct	9 ms	512 KB	Output is correct
27	Correct	10 ms	512 KB	Output is correct
28	Correct	1012 ms	868 KB	Output is correct
29	Correct	1033 ms	876 KB	Output is correct
30	Correct	1016 ms	896 KB	Output is correct
31	Correct	1030 ms	788 KB	Output is correct
32	Correct	986 ms	1116 KB	Output is correct
33	Correct	984 ms	3704 KB	Output is correct
34	Correct	973 ms	3832 KB	Output is correct
35	Correct	1025 ms	6608 KB	Output is correct
36	Correct	974 ms	3588 KB	Output is correct
37	Correct	767 ms	640 KB	Output is correct
38	Correct	777 ms	640 KB	Output is correct
39	Correct	778 ms	640 KB	Output is correct
40	Incorrect	3 ms	512 KB	Output isn't correct
41	Halted	0 ms	0 KB	-

Submission #116140

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