Submission #1438986
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++) #define fi first #define se second using namespace std; typedef pair<int, int> pii; class BinaryIndexedTree { vector<int> a; public: BinaryIndexedTree(int n) { a.clear(); REP(i, 0, n) a.push_back(0); } int query(int i) { if(!(i + 1)) return 0; return max(a[i], query((i + 1) - ((i + 1) & -(i + 1)) - 1)); } void update(int i, int n) { if(i > a.size()) return; a[i] = max(a[i], n); update((i + 1) + ((i + 1) & -(i + 1)) - 1, n); } }; const int SIZE = 100000; int N; pii D[SIZE]; int main(void) { cin >> N; REP(i, 0, N) cin >> D[i].fi >> D[i].se; sort(D, D + N); BinaryIndexedTree bit(SIZE + 1); vector<pii> q; REP(i, 0, N) { q.push_back(pii(D[i].se, bit.query(D[i].se - 1) + 1)); if(i + 1 == N || D[i].fi != D[i + 1].fi) { REP(j, 0, q.size()) bit.update(q[j].fi, q[j].se); q.clear(); } } cout << bit.query(SIZE + 1) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - プレゼント |
User | kshinya |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1105 Byte |
Status | AC |
Exec Time | 70 ms |
Memory | 1660 KB |
Judge Result
Set Name | Sample | Subtask0 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
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 | 892 KB |
sample1.txt | AC | 2 ms | 892 KB |
sample2.txt | AC | 2 ms | 892 KB |
sample3.txt | AC | 2 ms | 892 KB |
subtask0_0.txt | AC | 2 ms | 892 KB |
subtask0_1.txt | AC | 2 ms | 892 KB |
subtask0_10.txt | AC | 2 ms | 892 KB |
subtask0_11.txt | AC | 2 ms | 892 KB |
subtask0_12.txt | AC | 2 ms | 892 KB |
subtask0_13.txt | AC | 2 ms | 892 KB |
subtask0_14.txt | AC | 2 ms | 892 KB |
subtask0_2.txt | AC | 2 ms | 892 KB |
subtask0_3.txt | AC | 2 ms | 892 KB |
subtask0_4.txt | AC | 2 ms | 892 KB |
subtask0_5.txt | AC | 2 ms | 892 KB |
subtask0_6.txt | AC | 2 ms | 892 KB |
subtask0_7.txt | AC | 2 ms | 892 KB |
subtask0_8.txt | AC | 2 ms | 892 KB |
subtask0_9.txt | AC | 2 ms | 892 KB |
subtask1_0.txt | AC | 43 ms | 1404 KB |
subtask1_1.txt | AC | 3 ms | 892 KB |
subtask1_10.txt | AC | 62 ms | 1660 KB |
subtask1_11.txt | AC | 62 ms | 1660 KB |
subtask1_12.txt | AC | 69 ms | 1660 KB |
subtask1_13.txt | AC | 70 ms | 1660 KB |
subtask1_14.txt | AC | 70 ms | 1660 KB |
subtask1_2.txt | AC | 13 ms | 1020 KB |
subtask1_3.txt | AC | 59 ms | 1532 KB |
subtask1_4.txt | AC | 69 ms | 1660 KB |
subtask1_5.txt | AC | 11 ms | 1020 KB |
subtask1_6.txt | AC | 52 ms | 1404 KB |
subtask1_7.txt | AC | 29 ms | 1148 KB |
subtask1_8.txt | AC | 60 ms | 1532 KB |
subtask1_9.txt | AC | 31 ms | 1276 KB |