oj.uz

Submission #847482

# Submission time Handle Problem Language Result Execution time Memory
847482 2023-09-09T17:59:51 Z Lib Closing Time (IOI23_closing) C++17
0 / 100
 51 ms 16572 KB 
#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
long long pos[200003];
long long cost1[200003];
long long cost2[200003];
long long pfx1[200003];
long long pfx2[200003];
long long check[200003];
long long maxroll[200003]; //maxroll[i]=a <==> de "tra no" 1 khoang toi da =a, can rollback it nhat i vi tri tu loai 1 xuong loai 0
long long minupd[200003]; //minupt[i]=k <==> voi 1 budget<=i; upgrade duoc toi da k vi tri tu loai 1 len loai 2
struct cus{
bool operator()(const long long &x, const long long &y){
	return x>y;
}
};
int max_score(int N, int X, int Y, long long K, std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
	int n=N;
	int x=X;
	int y=Y;
	long long k=K;
	cin>>x>>y>>k;
	for(int i=0;i<n-1;i++){
		cin>>U[i]>>V[i]>>W[i];
		pos[i+1]=pos[i]+W[i];
	}
	for(int i=0;i<n;i++){
		cost1[i]=min(abs(pos[i]-pos[x]),abs(pos[i]-pos[y]));
		cost2[i]=max(abs(pos[i]-pos[x]),abs(pos[i]-pos[y]))-cost1[i];
		pfx1[i+1]=pfx1[i]+cost1[i];
	}
	priority_queue <pair <long long,int> > pq;
	long long mcost=k;
	long long ans=0,tans=0;
	int tpos;
		for(int i=0;i<n;i++){
			pq.push({-cost1[i],i});
		}
		while(!pq.empty()&&mcost>0){
			mcost+=pq.top().first;
			if(mcost>=0){
			ans++;
			check[pq.top().second]++;
			//cout<<pq.top().second<<" "<<check[pq.top().second]<<" "<<-pq.top().first<<"\n";
			tpos=pq.top().second;
			pq.pop();
			if(tpos<x){
				if(check[tpos]==1&&check[tpos+1]==2){
					pq.push({-cost2[tpos],tpos});
				}
			}else if(tpos>y){
				if(check[tpos]==1&&check[tpos-1]==2){
					pq.push({-cost2[tpos],tpos});
				}
			}else{
				if(tpos==0&&check[tpos]+check[tpos+1]==2||tpos==n-1&&check[tpos]+check[tpos-1]==2||0<tpos&&tpos<n-1&&check[tpos-1]+check[tpos+1]+check[tpos]==3){
				pq.push({-cost2[tpos],tpos});
				}		
			}
			}
		}
		tans=max(tans,ans);
	return tans;
}

Compilation message

closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:57:15: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   57 |     if(tpos==0&&check[tpos]+check[tpos+1]==2||tpos==n-1&&check[tpos]+check[tpos-1]==2||0<tpos&&tpos<n-1&&check[tpos-1]+check[tpos+1]+check[tpos]==3){
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
closing.cpp:57:104: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   57 |     if(tpos==0&&check[tpos]+check[tpos+1]==2||tpos==n-1&&check[tpos]+check[tpos-1]==2||0<tpos&&tpos<n-1&&check[tpos-1]+check[tpos+1]+check[tpos]==3){
      |                                                                                        ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6488 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 16572 KB 1st lines differ - on the 1st token, expected: '451', found: '371'
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Incorrect 1 ms 6492 KB 1st lines differ - on the 1st token, expected: '30', found: '17'
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Incorrect 1 ms 6492 KB 1st lines differ - on the 1st token, expected: '30', found: '17'
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Incorrect 1 ms 6492 KB 1st lines differ - on the 1st token, expected: '30', found: '17'
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6488 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6488 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6488 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6488 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6488 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -