oj.uz

Submission #203986

# Submission time Handle Problem Language Result Execution time Memory
203986 2020-02-23T13:12:00 Z awlintqaa Sails (IOI07_sails) C++14
40 / 100
 1000 ms 7428 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
ll n ;
pll a [100009];
multiset< ll > s;
ll calc ( ll x ) {
        if ( x == 0 ) return  0ll ;
        return  (x * (x -1ll ) / 2ll );
}
int main () {
        cin >> n ;
        for ( int i =0 ;i < n;i ++ ) {
                cin >> a[i].fi >> a[i].se;
        }
        sort ( a, a +n ) ;
        ll last =1 ;
        for ( int i =0 ;i < n;i ++ ) {
                while ( last <= a[i].fi ) {
                        s.ins( 0 ) ;
                        last ++ ;
                }
                vll ret;
                for ( auto u : s ) {
                        if ( ret.size () == a[i].se ) break;
                        ret .pb ( u ) ;
                }
                for ( auto u: ret ) {
                        s .era ( s.find ( u ) ) ;
                        s.ins ( u+1 );
                }
        }
        ll sum = 0 ;
        for ( auto u : s ) sum += calc ( u ) ;
        cout << sum << endl;
}

Compilation message

sails.cpp: In function 'int main()':
sails.cpp:50:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                         if ( ret.size () == a[i].se ) break;
                                          ^

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 376 KB Output is correct
2 Correct 26 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 656 ms 632 KB Output is correct
2 Correct 643 ms 5476 KB Output is correct

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1091 ms 1656 KB Time limit exceeded

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 7428 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 1098 ms 2040 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 1091 ms 2904 KB Time limit exceeded
2 Halted 0 ms 0 KB -