Submission #1119656
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define ALL(x) x.begin(),x.end()
#define REACH cerr<<"reached line "<<__LINE__<<endl
#define DBG(x) cerr<<"line "<<__LINE__<<" "<<#x<<":"<<x<<endl
using pi=pair<int,int>;
using vi=vector<int>;
using ld=long double;
template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
os<<"("<<p.first<<","<<p.second<<")";
return os;
}
template<class T>
ostream& operator <<(ostream& os,const vector<T>& v){
os<<"[";
REP(i,(int)v.size()){
if(i)os<<",";
os<<v[i];
}
os<<"]";
return os;
}
int read(){
int i;
scanf("%lld",&i);
return i;
}
void printSpace(){
printf(" ");
}
void printEoln(){
printf("\n");
}
void print(int x,int suc=1){
printf("%lld",x);
if(suc==1)
printEoln();
if(suc==2)
printSpace();
}
string readString(){
static char buf[3341919];
scanf("%s",buf);
return string(buf);
}
char* readCharArray(){
static char buf[3341919];
static int bufUsed=0;
char* ret=buf+bufUsed;
scanf("%s",ret);
bufUsed+=strlen(ret)+1;
return ret;
}
template<class T,class U>
void chmax(T& a,U b){
if(a<b)
a=b;
}
template<class T,class U>
void chmin(T& a,U b){
if(a>b)
a=b;
}
template<class T>
T Sq(const T& t){
return t*t;
}
const int inf=LLONG_MAX/3;
vi ord,low,ins,belong;
int ordIdx,cmpIdx;
void dfs(const vector<vi>& graph,int v,stack<int>& s){
s.push(v);
ord[v]=low[v]=ordIdx++;
ins[v]=1;
for(auto to:graph[v])
if(ord[to]==-1){
dfs(graph,to,s);
chmin(low[v],low[to]);
}else if(ins[to])
chmin(low[v],ord[to]);
if(ord[v]==low[v]){
while(1){
int g=s.top();s.pop();
belong[g]=cmpIdx;
ins[g]=0;
if(g==v)break;
}
cmpIdx++;
}
}
void BuildSCC(const vector<vi>& graph){
int n=graph.size();
ord.assign(n,-1);
low.assign(n,-1);
ins.assign(n,0);
belong.assign(n,-1);
stack<int> s;
ordIdx=0,cmpIdx=0;
REP(i,n)if(ord[i]==-1)
dfs(graph,i,s);
}
struct Flag{
int x,y;
};
struct Snuke{
int v,i,t;
bool operator<(const Snuke& rhs)const{
if(v!=rhs.v)return v<rhs.v;
else if(i!=rhs.i)return i<rhs.i;
else return t<rhs.t;
}
};
void SetEdge(vector<vi>& graph,int b,int e,int l,int r,int i,int from){
if(e<=b)return;
if(e<=l||r<=b)return;
if(b<=l&&r<=e)return void(graph[from].PB(i));
SetEdge(graph,b,e,l,(l+r)/2,i*2,from);
SetEdge(graph,b,e,(l+r)/2,r,i*2+1,from);
}
bool Wafrelka(const int n,const vector<Flag>& fs,const vector<Snuke>& ss,const int d){
int s=1;
while(s<n*2)s*=2;
vector<vi> graph(s*2);
FOR(i,1,s){
graph[i].PB(i*2);
graph[i].PB(i*2+1);
}
REP(i,n){
int xi=lower_bound(ALL(ss),Snuke{fs[i].x,i,1})-ss.begin();
int yi=lower_bound(ALL(ss),Snuke{fs[i].y,i,2})-ss.begin();
{
int b=lower_bound(ALL(ss),Snuke{fs[i].x-d+1,-inf,0})-ss.begin();
int e=lower_bound(ALL(ss),Snuke{fs[i].x+d-1,inf,0})-ss.begin();
SetEdge(graph,b,xi,0,s,1,yi+s);
SetEdge(graph,xi+1,e,0,s,1,yi+s);
}
{
int b=lower_bound(ALL(ss),Snuke{fs[i].y-d+1,-inf,0})-ss.begin();
int e=lower_bound(ALL(ss),Snuke{fs[i].y+d-1,inf,0})-ss.begin();
SetEdge(graph,b,yi,0,s,1,xi+s);
SetEdge(graph,yi+1,e,0,s,1,xi+s);
}
}
BuildSCC(graph);
REP(i,n){
int xi=lower_bound(ALL(ss),Snuke{fs[i].x,i,1})-ss.begin();
int yi=lower_bound(ALL(ss),Snuke{fs[i].y,i,2})-ss.begin();
if(belong[xi+s]==belong[yi+s])
return false;
}
return true;
}
signed main(){
int n=read();
vector<Flag> fs;
vector<Snuke> ss;
REP(i,n){
int x=read(),y=read();
fs.PB(Flag{x,y});
ss.PB(Snuke{x,i,1});
ss.PB(Snuke{y,i,2});
}
sort(ALL(ss));
int l=0,r=1000000000;
while(r-l>1){
const int mid=(r+l)/2;
if(Wafrelka(n,fs,ss,mid))
l=mid;
else
r=mid;
}
print(l);
}
Submission Info
Submission Time
2017-02-18 23:29:51+0900
Task
F - Flags
User
maroonrk
Language
C++14 (GCC 5.4.1)
Score
1200
Code Size
3973 Byte
Status
AC
Exec Time
1167 ms
Memory
16152 KB
Compile Error
./Main.cpp: In function ‘ll read()’:
./Main.cpp:38:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld",&i);
^
./Main.cpp: In function ‘std::string readString()’:
./Main.cpp:60:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s",buf);
^
./Main.cpp: In function ‘char* readCharArray()’:
./Main.cpp:68:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s",ret);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
1200 / 1200
Status
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
2 ms
256 KB
01.txt
AC
20 ms
640 KB
02.txt
AC
8 ms
384 KB
03.txt
AC
3 ms
256 KB
04.txt
AC
4 ms
256 KB
05.txt
AC
4 ms
384 KB
06.txt
AC
877 ms
12984 KB
07.txt
AC
854 ms
12984 KB
08.txt
AC
853 ms
12984 KB
09.txt
AC
20 ms
640 KB
10.txt
AC
8 ms
384 KB
11.txt
AC
3 ms
256 KB
12.txt
AC
4 ms
256 KB
13.txt
AC
4 ms
384 KB
14.txt
AC
792 ms
12984 KB
15.txt
AC
790 ms
12868 KB
16.txt
AC
784 ms
12876 KB
17.txt
AC
22 ms
640 KB
18.txt
AC
10 ms
384 KB
19.txt
AC
953 ms
12984 KB
20.txt
AC
928 ms
12984 KB
21.txt
AC
1081 ms
13104 KB
22.txt
AC
1081 ms
13112 KB
23.txt
AC
1167 ms
16152 KB
24.txt
AC
982 ms
15200 KB
25.txt
AC
953 ms
15400 KB
26.txt
AC
979 ms
12984 KB
27.txt
AC
1 ms
256 KB