Submission #747621


Source Code Expand

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

typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second

typedef pair<int,int> pi;
const int INF=12345678;

int main()
{
    int n;
    cin >>n;
    vector<pi> p(n);
    rep(i,n) scanf(" %d %d", &p[i].fi, &p[i].se);
    rep(i,n) p[i].se=-p[i].se;

    sort(all(p));

    vector<int> h(n);
    rep(i,n) h[i]=-p[i].se;

    vector<int> dp(n+1,INF);
    rep(i,n)
    {
        *lower_bound(all(dp),h[i])=h[i];
    }
    printf("%d\n", lower_bound(all(dp),INF)-dp.begin());

    return 0;
}

Submission Info

Submission Time
Task D - プレゼント
User imulan
Language C++14 (GCC 5.4.1)
Score 100
Code Size 782 Byte
Status AC
Exec Time 61 ms
Memory 1792 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:34:55: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type {aka long int}’ [-Wformat=]
     printf("%d\n", lower_bound(all(dp),INF)-dp.begin());
                                                       ^
./Main.cpp:21:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     rep(i,n) scanf(" %d %d", &p[i].fi, &p[i].se);
                                                 ^

Judge Result

Set Name Sample Subtask0 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 4
AC × 19
AC × 30
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 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 4 ms 256 KB
sample1.txt AC 4 ms 256 KB
sample2.txt AC 4 ms 256 KB
sample3.txt AC 4 ms 256 KB
subtask0_0.txt AC 4 ms 256 KB
subtask0_1.txt AC 4 ms 256 KB
subtask0_10.txt AC 4 ms 256 KB
subtask0_11.txt AC 4 ms 256 KB
subtask0_12.txt AC 4 ms 256 KB
subtask0_13.txt AC 4 ms 256 KB
subtask0_14.txt AC 4 ms 256 KB
subtask0_2.txt AC 4 ms 256 KB
subtask0_3.txt AC 4 ms 256 KB
subtask0_4.txt AC 4 ms 256 KB
subtask0_5.txt AC 4 ms 256 KB
subtask0_6.txt AC 4 ms 256 KB
subtask0_7.txt AC 4 ms 256 KB
subtask0_8.txt AC 4 ms 256 KB
subtask0_9.txt AC 4 ms 256 KB
subtask1_0.txt AC 37 ms 1152 KB
subtask1_1.txt AC 5 ms 256 KB
subtask1_10.txt AC 48 ms 1792 KB
subtask1_11.txt AC 41 ms 1792 KB
subtask1_12.txt AC 59 ms 1792 KB
subtask1_13.txt AC 59 ms 1792 KB
subtask1_14.txt AC 61 ms 1792 KB
subtask1_2.txt AC 12 ms 512 KB
subtask1_3.txt AC 52 ms 1536 KB
subtask1_4.txt AC 59 ms 1792 KB
subtask1_5.txt AC 11 ms 512 KB
subtask1_6.txt AC 44 ms 1408 KB
subtask1_7.txt AC 25 ms 896 KB
subtask1_8.txt AC 51 ms 1536 KB
subtask1_9.txt AC 27 ms 896 KB