# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
879395 | 2023-11-27T09:53:00 Z | vjudge1 | Sure Bet (CEOI17_sure) | C++17 | 0 ms | 452 KB |
/* ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠟⠛⠛⠛⠛⠛⠿⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠿⠛⠛⠉⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠙⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠟⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⠞⢛⣛⠻⣷⡄⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣴⣿⢡⣾⣿⣿⣷⢹⡇⠋⠉⠀⢀⣀⣀⣀⠉⠙⢿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠁⠀⢠⣴⣶⣶⣤⠀⠀⠀⠀⣿⣷⣜⠿⠿⠟⣡⠟⠁⢀⡠⠂⠉⠀⠀⠀⠉⠐⡄⠹⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠟⠁⠀⠻⢷⡿⠟⠁⢀⣾⡄⠀⠛⠿⢿⠷⠶⠚⣋⠠⠒⠉⠣⡀⠀⠀⠀⠀⠀⠀⡇⠀⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠋⠰⠅⠀⠄⠀⠀⠀⠀⠀⠊⠀⠈⠀⠀⣀⠠⠤⠒⠉⠀⠀⠀⠀⠀⠙⠄⠀⠀⠀⠀⠀⠃⢠⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠃⠀⠁⠀⠀⠀⠊⠉⠓⠒⠒⠒⠚⠋⠉⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠳⡀⠀⢀⠄⣠⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡄⠀⠢⡀⢠⠆⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⠰⠆⣀⠴⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⠤⢀⠈⠺⢄⡀⠀⠀⠀⠀⠀⠀⠀⠀⠈⡆⠀⠀⠀⠀⠀⠀⣀⣀⠠⠄⠊⣁⠄⠀⠁⠀⠀⣻⣛⠛⢛⣉ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣇⠀⠀⠉⠂⠀⠈⠙⢒⠒⠒⠒⠂⠀⠀⠀⠐⠀⠀⠒⠒⠊⢉⡀⠀⠀⠐⠈⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡟⣸⣿⡀⠀⠀⠀⠀⠀⠀⠁⠢⣀⣀⣀⣀⣀⣀⣠⣤⢴⠊⠉⠉⠀⠀⠀⠀⠀⠀⢀⣀⣠⣴⠻⠿⠿⠿⠿⠿ ⣿⣿⡿⠿⠿⢿⣿⡿⢟⣩⣶⣿⣿⣿⢷⣀⠀⠀⠀⠀⠀⠀⠰⣈⠻⣿⡿⠟⠋⠡⠇⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⣿⡜⣿⣿⣶⣶⣶⣶ ⢋⣴⣶⣶⣶⣶⣶⣾⣿⣿⣿⣿⣿⠏⣼⣿⣿⣤⣤⠀⠀⠀⠀⠘⠀⠤⠤⠔⢂⠂⣀⣀⣀⣀⣀⣤⣾⣿⣿⣿⣿⣿⣿⣷⣌⠻⣿⣿⣿⣿ ⠛⢿⣿⠿⠿⢿⣿⣿⣿⣿⣿⣿⠟⣸⣿⣿⣿⣿⣿⣤⣴⣆⣀⣰⠀⠀⠀⠀⠱⡀⢹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣦⣙⠻⣿ */ #include<bits/stdc++.h> using namespace std; #define ll long long int #define lld long long double #define pb push_back #define pf push_front #define all(a) a.begin(),a.end() #define IShowSpeed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); const int N=5e5+10; const int mod=1e9+7; vector<double>v1,v2; int main() { IShowSpeed int n,x1,y1; cin>>n; for(int i=1;i<=n;i++) { double x,y; cin>>x>>y; v1.pb(x); v2.pb(y); } sort(all(v1)); sort(all(v2)); reverse(all(v1)); reverse(all(v2)); for(int i=1;i<v1.size();i++) v1[i]+=v1[i-1]; for(int i=1;i<v2.size();i++) v2[i]+=v2[i-1]; double ans=0; int l=0,r=0; while(l+1<n || r+1<n) { if(r==n-1 || (l+1<n && min(v1[l+1],v2[r])>=min(v1[l],v2[r+1]))) l++; else r++; ans=max(ans,min(v1[l],v2[r])-(l+r+2)); } cout<<fixed<<setprecision(4)<<ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 452 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 452 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 452 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |