Submission #116130

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
116130	2019-06-10T18:20:14 Z	shayan_p	Arranging Tickets (JOI17_arranging_tickets)	C++14	45 / 100	6000 ms	640 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];
vector<int>v[maxn];
priority_queue<int>pq;

int best(){
    int ans=0;
    for(int i=0;i<n;i++){
	for(int x:v[i])
	    pq.push(x);
	while(arr[i]>0){
	    if(pq.empty() || pq.top()<i) return m+1;
	    int x=pq.top();
	    pq.pop();
	    ans++;
	    for(int k=i;k<x;k++)
		arr[k]--;
	}
    }
    return ans;
}

ll solve2(){
    memset(val,0,sizeof val);
    for(int i=0;i<n;i++){
	v[i].clear();
    }
    
    for(int i=0;i<m;i++){
	if(a[i]>b[i]) swap(a[i],b[i]);
	for(int j=a[i];j<b[i];j++)
	    val[j]++;
	v[a[i]].PB(b[i]);
    }
    
    int ans=m;
    for(int ng=0;ng<m;ng++){
	int l=-1,r=m;
	while(r-l>1){
	    int mid=(l+r)>>1;

	    for(int j=0;j<n;j++){
		arr[j]= (val[j] - mid + 1)/2;
	    }
	    
	    while(sz(pq)){
		pq.pop();
	    }
	    if(best()>ng) l=mid;
	    else r=mid;

	}
	ans=min(ans,r+ng);
    }
    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];
    return cout<<solve2()<<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	384 KB	Output is correct
2	Correct	2 ms	512 KB	Output is correct
3	Correct	3 ms	512 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 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	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	512 KB	Output is correct

Subtask #2
35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	512 KB	Output is correct
3	Correct	3 ms	512 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 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	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	512 KB	Output is correct
16	Correct	77 ms	532 KB	Output is correct
17	Correct	77 ms	512 KB	Output is correct
18	Correct	77 ms	512 KB	Output is correct
19	Correct	77 ms	384 KB	Output is correct
20	Correct	81 ms	536 KB	Output is correct
21	Correct	78 ms	512 KB	Output is correct
22	Correct	77 ms	512 KB	Output is correct
23	Correct	77 ms	512 KB	Output is correct
24	Correct	65 ms	504 KB	Output is correct
25	Correct	62 ms	384 KB	Output is correct
26	Correct	69 ms	500 KB	Output is correct
27	Correct	75 ms	504 KB	Output is correct

Subtask #3
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	512 KB	Output is correct
3	Correct	3 ms	512 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 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	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	512 KB	Output is correct
16	Correct	77 ms	532 KB	Output is correct
17	Correct	77 ms	512 KB	Output is correct
18	Correct	77 ms	512 KB	Output is correct
19	Correct	77 ms	384 KB	Output is correct
20	Correct	81 ms	536 KB	Output is correct
21	Correct	78 ms	512 KB	Output is correct
22	Correct	77 ms	512 KB	Output is correct
23	Correct	77 ms	512 KB	Output is correct
24	Correct	65 ms	504 KB	Output is correct
25	Correct	62 ms	384 KB	Output is correct
26	Correct	69 ms	500 KB	Output is correct
27	Correct	75 ms	504 KB	Output is correct
28	Execution timed out	6059 ms	640 KB	Time limit exceeded
29	Halted	0 ms	0 KB	-

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	512 KB	Output is correct
3	Correct	3 ms	512 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 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	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	512 KB	Output is correct
16	Correct	77 ms	532 KB	Output is correct
17	Correct	77 ms	512 KB	Output is correct
18	Correct	77 ms	512 KB	Output is correct
19	Correct	77 ms	384 KB	Output is correct
20	Correct	81 ms	536 KB	Output is correct
21	Correct	78 ms	512 KB	Output is correct
22	Correct	77 ms	512 KB	Output is correct
23	Correct	77 ms	512 KB	Output is correct
24	Correct	65 ms	504 KB	Output is correct
25	Correct	62 ms	384 KB	Output is correct
26	Correct	69 ms	500 KB	Output is correct
27	Correct	75 ms	504 KB	Output is correct
28	Execution timed out	6059 ms	640 KB	Time limit exceeded
29	Halted	0 ms	0 KB	-

Subtask #5
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	512 KB	Output is correct
3	Correct	3 ms	512 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 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	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	512 KB	Output is correct
16	Correct	77 ms	532 KB	Output is correct
17	Correct	77 ms	512 KB	Output is correct
18	Correct	77 ms	512 KB	Output is correct
19	Correct	77 ms	384 KB	Output is correct
20	Correct	81 ms	536 KB	Output is correct
21	Correct	78 ms	512 KB	Output is correct
22	Correct	77 ms	512 KB	Output is correct
23	Correct	77 ms	512 KB	Output is correct
24	Correct	65 ms	504 KB	Output is correct
25	Correct	62 ms	384 KB	Output is correct
26	Correct	69 ms	500 KB	Output is correct
27	Correct	75 ms	504 KB	Output is correct
28	Execution timed out	6059 ms	640 KB	Time limit exceeded
29	Halted	0 ms	0 KB	-

Submission #116130

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 35.0 / 35.0

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

Subtask #4
0 / 20.0

Subtask #5
0 / 15.0