oj.uz

Submission #890416

# Submission time Handle Problem Language Result Execution time Memory
890416 2023-12-21T06:55:22 Z Sir_Ahmed_Imran Sails (IOI07_sails) C++17
60 / 100
 1000 ms 3540 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});
            Q.pop_back();
        }
        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

sails.cpp: In function 'void solve()':
sails.cpp:11:10: warning: unused variable 'm' [-Wunused-variable]
   11 |     ll n,m,o,p,q,r;
      |          ^
sails.cpp:11:18: warning: unused variable 'r' [-Wunused-variable]
   11 |     ll n,m,o,p,q,r;
      |                  ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 484 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 700 KB Output is correct
2 Correct 103 ms 1248 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1033 ms 2108 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 696 ms 1820 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 647 ms 2520 KB Output is correct
2 Execution timed out 1008 ms 3540 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1095 ms 3068 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1070 ms 2520 KB Time limit exceeded
2 Halted 0 ms 0 KB -