# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167556 | Warinchai | Parkovi (COCI22_parkovi) | C++20 | 592 ms | 23060 KiB |
#include<bits/stdc++.h>
#define int long long
using namespace std;
vector<pair<int,int>>adj[200006];
int w[200006];
int vis[200005];
int sum[200005];
int dp[200005];
int back[200005];
int place[200005];
int n,k;
vector<int>ans;
int check(int m){
for(int i=1;i<=n;i++)dp[i]=0;
for(int i=2;i<=n;i++){
int st=1,en=i,ans=0;
while(st<=en){
int md=(st+en)/2;
//cerr<<st<<" "<<en<<" "<<md<<"\n";
if(sum[i-1]-sum[md-1]<=m){
ans=md;
en=md-1;
}else{
st=md+1;
}
}
//cerr<<"ans1:"<<ans<<"\n";
int ans2=0;
st=1,en=ans;
while(st<=en){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |