Submission #5820562


Source Code Expand

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

const int MN = 100010;

int N;
int A[MN], B[MN];
vector<int> Va[MN], Vb[MN];

int main() {
    scanf("%d", &N);

    for(int i = 0; i < N; i++) {
        scanf("%d %d", &A[i], &B[i]);

        Va[ A[i] ].push_back(i);
        Vb[ B[i] ].push_back(i);
    }

    if(A[0] || B[1]) {
        printf("-1");
        return 0;
    }
    if(Va[0].size() > 1 || Vb[0].size() > 1) {
        printf("-1");
        return 0;
    }

    multiset<int> pre;
    pre.insert(B[0]);

    for(int i = 1; i < N; i++) {
        multiset<int> cur;

        for(int j = 0; j < Va[i].size(); j++) {
            int x = Va[i][j];

            auto it = pre.lower_bound(B[x] - 1);
            if(it == pre.end() || B[x] + 1 < *it) {
                printf("-1");
                return 0;
            }

            cur.insert(B[x]);
        }
        pre = cur;
    }

    int ans = N - 1;

    pre.clear();
    pre.insert(A[1]);

    multiset<int> alive = pre;
    for(int i = 1; i < N; i++) {
        multiset<int> cur;
        multiset<int> tmp;

        for(int j = 0; j < Vb[i].size(); j++) {
            int x = Vb[i][j];

            auto it = pre.lower_bound(A[x] - 1);
            if(it == pre.end() || A[x] + 1 < *it) {
                printf("-1");
                return 0;
            }
            cur.insert(A[x]);
        }

        vector<int> chk(Vb[i].size(), 0);
        for(int j = 0; j < Vb[i].size(); j++) {
            int x = Vb[i][j];

            if(pre.find(A[x] - 1) != pre.end()) {
                chk[j] = 1;
                continue;
            }
        }
        for(int j = 0; j < Vb[i].size(); j++) if(!chk[j]) {
            int x = Vb[i][j];

            tmp.insert(A[x]);
            if(alive.find(A[x] + 1) != alive.end()) {
                alive.erase(alive.find(A[x] + 1));
                continue;
            }
            else ans++;
        }

        pre = cur;
        alive = tmp;
    }

    printf("%d", ans);
}

Submission Info

Submission Time
Task A - Distance Pairs
User choikiwon
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2080 Byte
Status WA
Exec Time 96 ms
Memory 25588 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
                    ^
./Main.cpp:14:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &A[i], &B[i]);
                                     ^

Judge Result

Set Name sample All
Score / Max Score 0 / 0 0 / 1500
Status
AC × 2
AC × 29
WA × 6
Set Name Test Cases
sample sample-01.txt, sample-02.txt
All sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt AC 37 ms 9728 KB
01-02.txt AC 17 ms 7040 KB
01-03.txt AC 3 ms 4992 KB
01-04.txt AC 3 ms 4992 KB
01-05.txt AC 4 ms 4992 KB
01-06.txt AC 37 ms 8576 KB
01-07.txt WA 60 ms 7040 KB
01-08.txt WA 66 ms 7040 KB
01-09.txt WA 68 ms 7424 KB
01-10.txt AC 66 ms 10100 KB
01-11.txt AC 50 ms 6912 KB
01-12.txt AC 49 ms 6912 KB
01-13.txt AC 54 ms 9088 KB
01-14.txt AC 64 ms 11904 KB
01-15.txt AC 55 ms 11904 KB
01-16.txt AC 65 ms 16244 KB
01-17.txt AC 92 ms 25588 KB
01-18.txt AC 96 ms 25588 KB
01-19.txt AC 56 ms 8832 KB
01-20.txt WA 62 ms 7808 KB
01-21.txt WA 62 ms 7808 KB
01-22.txt WA 60 ms 7424 KB
01-23.txt AC 39 ms 7040 KB
01-24.txt AC 34 ms 7040 KB
01-25.txt AC 18 ms 6912 KB
01-26.txt AC 18 ms 6784 KB
01-27.txt AC 18 ms 6912 KB
01-28.txt AC 18 ms 6784 KB
01-29.txt AC 3 ms 4992 KB
01-30.txt AC 3 ms 4992 KB
01-31.txt AC 3 ms 4992 KB
sample-01.txt AC 3 ms 4992 KB
sample-02.txt AC 3 ms 4992 KB