Submission #1442098


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount

#define INF INT_MAX/3


//// BinaryIndexedTree (区間の和を高速に行う)
// 1D (0-indexed)
#define MAX_N 123456
struct BIT{
  ll bit[MAX_N];
  // 初期化
  void init(){
    memset(bit,0,sizeof(bit));
  }

  int query(int i) {
    if(!(i + 1)) return 0;
    return mmax(bit[i], query((i + 1) - ((i + 1) & -(i + 1)) - 1));
  }

  void update(int i, int n) {
    if(i > MAX_N) return;
    bit[i] = mmax(bit[i], n);
    update((i + 1) + ((i + 1) & -(i + 1)) - 1, n);
  }
};


#define SIZE 100000
int main(){
  cin.sync_with_stdio(false);

  BIT bit;
  bit.init();
  int N;
  cin >> N;
  P hw[SIZE];
  rep(i,N) cin >> hw[i].fi >> hw[i].se;
  sort(hw,hw+N);
  vector<P> q;
  rep(i,N){
    q.pb(P(hw[i].se,bit.query(hw[i].se-1)+1));
    if(i+1 == N || hw[i].fi != hw[i+1].fi){
      rep(j,q.size())bit.update(q[j].fi,q[j].se);
      q.clear();
    }
  }
  cout << bit.query(SIZE+1)<<endl;
}

Submission Info

Submission Time
Task D - プレゼント
User hayabusa104
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1580 Byte
Status AC
Exec Time 156 ms
Memory 2816 KB

Judge Result

Set Name Sample Subtask0 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 4
AC × 19
AC × 34
Set Name Test Cases
Sample sample0.txt, sample1.txt, sample2.txt, sample3.txt
Subtask0 subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, sample0.txt, sample1.txt, sample2.txt, sample3.txt
All sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
sample0.txt AC 2 ms 2816 KB
sample1.txt AC 2 ms 2816 KB
sample2.txt AC 2 ms 2816 KB
sample3.txt AC 2 ms 2816 KB
subtask0_0.txt AC 2 ms 2816 KB
subtask0_1.txt AC 2 ms 2816 KB
subtask0_10.txt AC 2 ms 2816 KB
subtask0_11.txt AC 2 ms 2816 KB
subtask0_12.txt AC 3 ms 2816 KB
subtask0_13.txt AC 3 ms 2816 KB
subtask0_14.txt AC 3 ms 2816 KB
subtask0_2.txt AC 2 ms 2816 KB
subtask0_3.txt AC 2 ms 2816 KB
subtask0_4.txt AC 3 ms 2816 KB
subtask0_5.txt AC 2 ms 2816 KB
subtask0_6.txt AC 3 ms 2816 KB
subtask0_7.txt AC 3 ms 2816 KB
subtask0_8.txt AC 3 ms 2816 KB
subtask0_9.txt AC 2 ms 2816 KB
subtask1_0.txt AC 41 ms 2816 KB
subtask1_1.txt AC 4 ms 2816 KB
subtask1_10.txt AC 23 ms 2816 KB
subtask1_11.txt AC 156 ms 2816 KB
subtask1_12.txt AC 64 ms 2816 KB
subtask1_13.txt AC 63 ms 2816 KB
subtask1_14.txt AC 64 ms 2816 KB
subtask1_2.txt AC 14 ms 2816 KB
subtask1_3.txt AC 56 ms 2816 KB
subtask1_4.txt AC 64 ms 2816 KB
subtask1_5.txt AC 13 ms 2816 KB
subtask1_6.txt AC 49 ms 2816 KB
subtask1_7.txt AC 29 ms 2816 KB
subtask1_8.txt AC 55 ms 2816 KB
subtask1_9.txt AC 32 ms 2816 KB