Submission #634055


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

// http://sigma425.hatenablog.com/entry/2016/01/24/123351
// http://qiita.com/uwi@github/items/1d087aed9bc9a3414c3f

// segtree
#define MAX 262144
#define N_VAL 131072
ll data[MAX];
void addrange(int a,int b,int k,int l,int r,ll v){
  if(r<=a || b<=l) return;
  if(a<=l && r<=b) data[k] += v;
  else{
    addrange(a,b,k*2+1,l,(l+r)/2,v);
    addrange(a,b,k*2+2,(l+r)/2,r,v);
  }
}
void addrange(int l,int r,ll v){
  addrange(l,r,0,0,N_VAL,v);
}
ll getat(int k){
  ll ret = 0;
  k += N_VAL - 1;
  ret += data[k];
  while(k>0){
    k = (k-1)/2;
    ret += data[k];
  }
  return ret;
}

// solve
int main(){
  ll n,l;
  cin>>n>>l;
  ll x[n];
  REP(i,n){
    ll t,p;
    cin>>t>>p;
    x[i] = t*10000000ll + 1000000ll-p;
  }
  sort(x,x+n);
  ll ans = 0;
  REP(i,n){
    // ll t = x[i] / 10000000ll;
    ll p = 1000000ll - (x[i] % 10000000ll);
    ans += p;
    ll left=-1, right=N_VAL;
    while(left+1<right){
      ll mid = (left+right)/2;
      if(getat(mid)>=0)right=mid;
      else left=mid;
    }
    addrange(0,p,-1);
    addrange(p,right,1);
  }
  REP(i,N_VAL)ans+=getat(i);
  cout<<ans<<endl;
  return 0;
}

Submission Info

Submission Time
Task E - 花火
User rickytheta
Language C++ (GCC 4.9.2)
Score 160
Code Size 1724 Byte
Status AC
Exec Time 270 ms
Memory 3168 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 130 / 130
Status
AC × 3
AC × 45
AC × 95
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt, subtask1_40.txt, subtask1_41.txt, subtask1_42.txt
Subtask2 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt, subtask1_40.txt, subtask1_41.txt, subtask1_42.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt, subtask2_31.txt, subtask2_32.txt, subtask2_33.txt, subtask2_34.txt, subtask2_35.txt, subtask2_36.txt, subtask2_37.txt, subtask2_38.txt, subtask2_39.txt, subtask2_40.txt, subtask2_41.txt, subtask2_42.txt, subtask2_43.txt, subtask2_44.txt, subtask2_45.txt, subtask2_46.txt, subtask2_47.txt, subtask2_48.txt, subtask2_49.txt, subtask2_50.txt
Case Name Status Exec Time Memory
sample_01.txt AC 34 ms 912 KB
sample_02.txt AC 31 ms 804 KB
sample_03.txt AC 30 ms 928 KB
subtask1_01.txt AC 35 ms 808 KB
subtask1_02.txt AC 35 ms 800 KB
subtask1_03.txt AC 34 ms 812 KB
subtask1_04.txt AC 35 ms 804 KB
subtask1_05.txt AC 34 ms 800 KB
subtask1_06.txt AC 35 ms 800 KB
subtask1_07.txt AC 34 ms 916 KB
subtask1_08.txt AC 34 ms 800 KB
subtask1_09.txt AC 35 ms 804 KB
subtask1_10.txt AC 35 ms 812 KB
subtask1_11.txt AC 33 ms 804 KB
subtask1_12.txt AC 34 ms 804 KB
subtask1_13.txt AC 32 ms 928 KB
subtask1_14.txt AC 33 ms 800 KB
subtask1_15.txt AC 33 ms 796 KB
subtask1_16.txt AC 32 ms 804 KB
subtask1_17.txt AC 34 ms 932 KB
subtask1_18.txt AC 32 ms 800 KB
subtask1_19.txt AC 35 ms 924 KB
subtask1_20.txt AC 32 ms 796 KB
subtask1_21.txt AC 35 ms 800 KB
subtask1_22.txt AC 35 ms 804 KB
subtask1_23.txt AC 35 ms 820 KB
subtask1_24.txt AC 35 ms 800 KB
subtask1_25.txt AC 34 ms 800 KB
subtask1_26.txt AC 34 ms 920 KB
subtask1_27.txt AC 34 ms 804 KB
subtask1_28.txt AC 35 ms 804 KB
subtask1_29.txt AC 32 ms 924 KB
subtask1_30.txt AC 34 ms 792 KB
subtask1_31.txt AC 33 ms 924 KB
subtask1_32.txt AC 33 ms 928 KB
subtask1_33.txt AC 34 ms 856 KB
subtask1_34.txt AC 33 ms 728 KB
subtask1_35.txt AC 32 ms 916 KB
subtask1_36.txt AC 33 ms 736 KB
subtask1_37.txt AC 30 ms 720 KB
subtask1_38.txt AC 29 ms 920 KB
subtask1_39.txt AC 30 ms 728 KB
subtask1_40.txt AC 30 ms 920 KB
subtask1_41.txt AC 31 ms 796 KB
subtask1_42.txt AC 30 ms 796 KB
subtask2_01.txt AC 265 ms 3100 KB
subtask2_02.txt AC 266 ms 3108 KB
subtask2_03.txt AC 265 ms 3112 KB
subtask2_04.txt AC 265 ms 3104 KB
subtask2_05.txt AC 265 ms 3100 KB
subtask2_06.txt AC 209 ms 2588 KB
subtask2_07.txt AC 160 ms 2064 KB
subtask2_08.txt AC 107 ms 1576 KB
subtask2_09.txt AC 186 ms 1576 KB
subtask2_10.txt AC 192 ms 1576 KB
subtask2_11.txt AC 203 ms 1568 KB
subtask2_12.txt AC 211 ms 1576 KB
subtask2_13.txt AC 240 ms 1704 KB
subtask2_14.txt AC 218 ms 3104 KB
subtask2_15.txt AC 230 ms 3104 KB
subtask2_16.txt AC 270 ms 3168 KB
subtask2_17.txt AC 247 ms 3112 KB
subtask2_18.txt AC 264 ms 3108 KB
subtask2_19.txt AC 163 ms 1576 KB
subtask2_20.txt AC 169 ms 1576 KB
subtask2_21.txt AC 179 ms 1676 KB
subtask2_22.txt AC 185 ms 1568 KB
subtask2_23.txt AC 222 ms 1568 KB
subtask2_24.txt AC 228 ms 3108 KB
subtask2_25.txt AC 228 ms 3104 KB
subtask2_26.txt AC 230 ms 3108 KB
subtask2_27.txt AC 237 ms 3036 KB
subtask2_28.txt AC 254 ms 3104 KB
subtask2_29.txt AC 198 ms 1700 KB
subtask2_30.txt AC 218 ms 3108 KB
subtask2_31.txt AC 236 ms 3112 KB
subtask2_32.txt AC 231 ms 2912 KB
subtask2_33.txt AC 244 ms 3112 KB
subtask2_34.txt AC 228 ms 3056 KB
subtask2_35.txt AC 190 ms 1572 KB
subtask2_36.txt AC 198 ms 1568 KB
subtask2_37.txt AC 221 ms 1696 KB
subtask2_38.txt AC 226 ms 3100 KB
subtask2_39.txt AC 218 ms 3100 KB
subtask2_40.txt AC 141 ms 1580 KB
subtask2_41.txt AC 178 ms 1576 KB
subtask2_42.txt AC 191 ms 1576 KB
subtask2_43.txt AC 245 ms 3108 KB
subtask2_44.txt AC 246 ms 3112 KB
subtask2_45.txt AC 193 ms 1580 KB
subtask2_46.txt AC 173 ms 1572 KB
subtask2_47.txt AC 185 ms 1568 KB
subtask2_48.txt AC 29 ms 792 KB
subtask2_49.txt AC 30 ms 808 KB
subtask2_50.txt AC 30 ms 796 KB