oj.uz

Submission #396652

# Submission time Handle Problem Language Result Execution time Memory
396652 2021-04-30T14:15:39 Z MarcoMeijer Sails (IOI07_sails) C++14
15 / 100
 1000 ms 1684 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 5e5;
const int N = (1<<20);

int n, m;
int h[MX], k[MX];
int a[MX], sm[MX];

void program() {
    IN(n);
    RE(i,n) IN(h[i],k[i]);
    RE(i,n) {
        m = max(m, h[i]);
        sm[h[i]-1]++;
        if(h[i]-1-k[i] >= 0)
            sm[h[i]-1-k[i]]--;
    }
    REV(i,0,m) sm[i] += sm[i+1];
    
    vii stck;


    RE(i,m) {
        if(stck.empty() || stck.back().se != 0)
            stck.pb({i,0});
        while(sm[i]) {
            ii p = stck.back(); stck.pop_back();
            int bg = p.fi;
            int length = i+1-bg;
            if(length <= sm[i]) {
                sm[i] -= length;
                a[bg]++;
                a[i+1]--;
                if(!stck.empty() && stck.back().se == p.se) {
                    // merge stack
                } else {
                    // dont merge stack
                    stck.push_back({p.fi,p.se+1});
                }
            } else {
                // we use up all the sum
                a[bg]++;
                a[bg+sm[i]]--;
                if(!stck.empty() && stck.back().se == p.se) {
                    // merge stack
                } else {
                    // dont merge stack
                    stck.push_back({p.fi,p.se+1});
                }
                stck.push_back({bg+sm[i],p.se});
                sm[i] = 0;
            }
        }
    }

    RE(i,m+1) a[i+1] += a[i];

    ll ans = 0;
    int x=0;
    while(true) {
        if(a[x] == 0) break;
        ans += ll(a[x])*ll(a[x]-1)/2ll;
        x++;
    }
    OUTL(ans);
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 43 ms 496 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 292 ms 880 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1094 ms 828 KB Time limit exceeded

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1092 ms 952 KB Time limit exceeded

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 1476 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 1097 ms 1684 KB Time limit exceeded
2 Halted 0 ms 0 KB -