# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
890414 | 2023-12-21T06:41:27 Z | Sir_Ahmed_Imran | Sails (IOI07_sails) | C++17 | 1000 ms | 5452 KB |
///~~~LOTA~~~/// #include <bits/stdc++.h> using namespace std; #define nl '\n' #define ff first #define ss second #define ll long long #define append push_back #define all(x) (x).begin(),(x).end() void solve(){ ll n,m,o,p,q,r; cin>>n; vector<pair<ll,ll>> v; for(int i=0;i<n;i++){ cin>>p>>q; v.append({p,q}); } sort(all(v)); vector<pair<ll,ll>> Q{{0,v[0].ff}}; o=0; p=v[0].ff; vector<pair<ll,ll>> u; for(auto& i:v){ if(i.ff>p){ if(Q.back().ff==0) Q.back().ss+=i.ff-p; else Q.append({0,i.ff-p}); } while(i.ss>Q.back().ss){ u.append(Q.back()); i.ss-=u.back().ss; u.back().ff++; Q.pop_back(); } if(i.ss){ u.append({Q.back().ff,Q.back().ss-i.ss}); u.append({Q.back().ff+1,i.ss}); } while(!u.empty()){ if(Q.empty()) Q.append(u.back()); else if(Q.back().ff==u.back().ff) Q.back().ss+=u.back().ss; else Q.append(u.back()); u.pop_back(); } p=i.ff; } for(auto& i:Q) o+=(i.ss*i.ff*(i.ff-1))/2; cout<<o<<nl; } int main(){ ios_base::sync_with_stdio(false);cin.tie(NULL); solve(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 604 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 60 ms | 1276 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1057 ms | 2488 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1059 ms | 4364 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1037 ms | 5108 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1067 ms | 4924 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1055 ms | 5452 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |