Submission #1177795


Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>

using namespace std;

#define MAX_N 100010

int main(){
    int N;

    cin >> N;
    int h,w;

    vector<pair<int,int> > vec(MAX_N,make_pair(0,0));
    for(int d = 0;d < N; d++){
        cin >> w >> h;
        vec[d].first = w;
        vec[d].second = h;
    }

    sort(vec.begin(),vec.end(),
     [](pair<int,int> b1,pair<int,int> b2){ 
         if(b1.first > b2.first) return true;
         else return b1.second > b2.second;
    });

    int ans = 1;
    for(int d = 0,j = 0; d < N-1; d++){
        if(vec[j].first > vec[d+1].first && vec[j].second > vec[d+1].second){
            ans++;
            if(d+1 < N) j=d+1;
        }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task D - プレゼント
User grun1396
Language C++14 (GCC 5.4.1)
Score 0
Code Size 797 Byte
Status RE
Exec Time 2103 ms
Memory 1024 KB

Judge Result

Set Name Sample Subtask0 All
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 4
AC × 5
RE × 14
AC × 6
TLE × 8
RE × 20
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 3 ms 1024 KB
sample1.txt AC 3 ms 1024 KB
sample2.txt AC 3 ms 1024 KB
sample3.txt AC 3 ms 1024 KB
subtask0_0.txt RE 98 ms 1024 KB
subtask0_1.txt RE 98 ms 1024 KB
subtask0_10.txt AC 4 ms 1024 KB
subtask0_11.txt RE 98 ms 1024 KB
subtask0_12.txt RE 100 ms 1024 KB
subtask0_13.txt RE 100 ms 1024 KB
subtask0_14.txt RE 98 ms 1024 KB
subtask0_2.txt RE 99 ms 1024 KB
subtask0_3.txt RE 100 ms 1024 KB
subtask0_4.txt RE 99 ms 1024 KB
subtask0_5.txt RE 98 ms 1024 KB
subtask0_6.txt RE 99 ms 1024 KB
subtask0_7.txt RE 101 ms 1024 KB
subtask0_8.txt RE 98 ms 1024 KB
subtask0_9.txt RE 98 ms 1024 KB
subtask1_0.txt TLE 2103 ms 1024 KB
subtask1_1.txt RE 100 ms 1024 KB
subtask1_10.txt AC 67 ms 1024 KB
subtask1_11.txt RE 166 ms 1024 KB
subtask1_12.txt TLE 2103 ms 1024 KB
subtask1_13.txt TLE 2103 ms 1024 KB
subtask1_14.txt TLE 2103 ms 1024 KB
subtask1_2.txt RE 210 ms 1024 KB
subtask1_3.txt TLE 2103 ms 1024 KB
subtask1_4.txt TLE 2103 ms 1024 KB
subtask1_5.txt RE 211 ms 1024 KB
subtask1_6.txt TLE 2103 ms 1024 KB
subtask1_7.txt RE 719 ms 1024 KB
subtask1_8.txt TLE 2103 ms 1024 KB
subtask1_9.txt RE 789 ms 1024 KB