Submission #1118136


Source Code Expand

#include<stdio.h>
#include<algorithm>
#include<vector>
#include<set>
#define pii pair<int,int>
using namespace std;
int A[101000], B[101000], n, mid, cnt, ord[201000], X[201000], SCC[201000];
set<pii>Set;
bool v[201000];
void DFS(int a, int x){
    int x2, pp;
    if(a<=n)x2 = X[a+n], pp=a+n;
    else x2 = X[a-n], pp=a-n;
    v[a] = true;
    Set.erase(pii(x2,pp));
    while(!Set.empty()){
        auto it = Set.lower_bound(pii(x-mid+1, -1));
        if(it==Set.end() || it->first > x+mid-1)break;
        int y = it->second;
        if(y==a){
            it++;
            if(it==Set.end() || it->first > x+mid-1)break;
            y = it->second;
        }
        if(y>n)DFS(y-n,X[y-n]);
        else DFS(y+n,X[y+n]);
    }
    ord[++cnt] = a;
}
void DFS2(int a, int x){
    SCC[a] = cnt;
    Set.erase(pii(x,a));
    int x2;
    if(a<=n)x2 = X[a+n];
    else x2 = X[a-n];
    while(!Set.empty()){
        auto it2 = Set.lower_bound(pii(x2-mid+1, -1));
        if(it2==Set.end() || it2->first > x2+mid-1)break;
        int y = it2->second;
        if(y==a-n || y==a+n){
            it2++;
            if(it2==Set.end() || it2->first > x2+mid-1)break;
            y = it2->second;
        }
        DFS2(y,X[y]);
    }
}
bool Pos(){
    int i;
    Set.clear();
    for(i=1;i<=n+n;i++){
        Set.insert(pii(X[i],i));
        v[i]=false;
        SCC[i] = 0;
    }
    for(i=1;i<=n+n;i++)v[i]=false;
    cnt = 0;
    for(i=1;i<=n+n;i++){
        if(!v[i])DFS(i, X[i]);
    }
    cnt = 0;
    for(i=1;i<=n+n;i++){
        Set.insert(pii(X[i],i));
    }
    for(i=n+n;i>=1;i--){
        if(!SCC[ord[i]]){
            cnt++;
            DFS2(ord[i],X[ord[i]]);
        }
    }
    for(i=1;i<=n;i++)if(SCC[i] == SCC[i+n])return false;
    return true;
}
int main(){
    int b = 0,e = 1000000000, res = 0, i;
    scanf("%d",&n);
    for(i=1;i<=n;i++){
        scanf("%d%d",&A[i],&B[i]);
        X[i]=A[i],X[n+i]=B[i];
    }
    while(b<=e){
        mid = (b+e)>>1;
        if(Pos()){
            b = mid + 1;
            res = mid;
        }
        else e = mid -1;
    }
    printf("%d\n",res);
}

Submission Info

Submission Time
Task F - Flags
User ainta
Language C++14 (GCC 5.4.1)
Score 1200
Code Size 2187 Byte
Status AC
Exec Time 621 ms
Memory 2432 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:76:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
./Main.cpp:78:34: 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 1200 / 1200
Status
AC × 3
AC × 30
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt, 00_example_03.txt
All 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 1 ms 256 KB
00_example_02.txt AC 1 ms 256 KB
00_example_03.txt AC 1 ms 256 KB
01.txt AC 14 ms 384 KB
02.txt AC 6 ms 256 KB
03.txt AC 2 ms 256 KB
04.txt AC 3 ms 256 KB
05.txt AC 3 ms 256 KB
06.txt AC 575 ms 2432 KB
07.txt AC 581 ms 2432 KB
08.txt AC 571 ms 2432 KB
09.txt AC 16 ms 384 KB
10.txt AC 6 ms 256 KB
11.txt AC 2 ms 256 KB
12.txt AC 3 ms 256 KB
13.txt AC 3 ms 256 KB
14.txt AC 619 ms 2432 KB
15.txt AC 619 ms 2432 KB
16.txt AC 621 ms 2432 KB
17.txt AC 14 ms 384 KB
18.txt AC 6 ms 256 KB
19.txt AC 555 ms 2432 KB
20.txt AC 555 ms 2432 KB
21.txt AC 452 ms 2432 KB
22.txt AC 451 ms 2432 KB
23.txt AC 334 ms 2432 KB
24.txt AC 273 ms 2432 KB
25.txt AC 251 ms 2432 KB
26.txt AC 493 ms 2432 KB
27.txt AC 1 ms 256 KB