Submission #1371175
Source Code Expand
#include "bits/stdc++.h"
using namespace std;
#define OUT(x) cout << #x << " = " << x << endl
#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)
#define rer(i, l, r) for (int (i) = (int)(l); (i) <= (int)(r); (i)++)
#define reu(i, l, r) for (int (i) = (int)(l); (i) < (int)(r); (i)++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<typename T> void pv(T a, T b) { for (T i = a; i != b; i ++) cout << *i << " "; cout << endl; }
template<typename T, typename U> inline void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if (x < y) x = y; }
int in() { int x; scanf("%d", &x); return x; }
long long lin() { long long x; scanf("%lld", &x); return x; }
int V;
vector<int> g[20202];
vector<int> rg[20202];
vector<int> order;
bool used[20202];
int cmp[20202];
int n;
vector<int> x, y;
void add_edge(int from, int to) {
g[from].push_back(to);
rg[to].push_back(from);
}
void dfs(int v) {
used[v] = true;
for (auto i : g[v]) if (!used[i]) dfs(i);
order.push_back(v);
}
void rdfs(int v, int k) {
used[v] = true;
cmp[v] = k;
for (auto i : rg[v]) if (!used[i]) rdfs(i, k);
}
int StronglyConnectedComponent() {
memset(used, 0, sizeof(used));
order.clear();
for (int i = 0; i < V; i ++) if (!used[i]) dfs(i);
memset(used, 0, sizeof(used));
int k = 0;
for (int i = order.size() - 1; i >= 0; i --) if (!used[order[i]]) rdfs(order[i], k ++);
return k;
}
bool B(int d) {
rep(i, 20202) g[i].clear();
rep(i, 20202) rg[i].clear();
order.clear();
memset(used, 0, sizeof(used));
memset(cmp, 0, sizeof(cmp));
int d1, d2, d3, d4;
rep(i, n) reu(j, i + 1, n) {
d1 = abs(x[i] - x[j]);
d2 = abs(x[i] - y[j]);
d3 = abs(y[i] - x[j]);
d4 = abs(y[i] - y[j]);
//OUT(d1);
//OUT(d2);
//OUT(d3);
//OUT(d4);
if (d1 >= d && d2 >= d && d3 >= d && d4 >= d) continue;
else if (d1 < d && d2 < d && d3 < d && d4 < d) return false;
else if (d1 >= d && d2 < d && d3 < d && d4 < d) {
add_edge(i + n, i);
add_edge(j + n, j);
}
else if (d1 < d && d2 >= d && d3 < d && d4 < d) {
add_edge(i + n, i);
add_edge(j, j + n);
}
else if (d1 < d && d2 < d && d3 >= d && d4 < d) {
add_edge(i, i + n);
add_edge(j + n, j);
}
else if (d1 < d && d2 < d && d3 < d && d4 >= d) {
add_edge(i, i + n);
add_edge(j, j + n);
}
else if (d1 >= d && d2 >= d && d3 < d && d4 < d) {
add_edge(i + n, i);
}
else if (d1 >= d && d2 < d && d3 >= d && d4 < d) {
add_edge(j + n, j);
}
else if (d1 >= d && d2 < d && d3 < d && d4 >= d) {
add_edge(i, j);
add_edge(i + n, j + n);
add_edge(j, i);
add_edge(j + n, i + n);
}
else if (d1 < d && d2 >= d && d3 >= d && d4 < d) {
add_edge(i, j + n);
add_edge(i + n, j);
add_edge(j + n, i);
add_edge(j, i + n);
}
else if (d1 < d && d2 >= d && d3 < d && d4 >= d) {
add_edge(j, j + n);
}
else if (d1 < d && d2 < d && d3 >= d && d4 >= d) {
add_edge(i, i + n);
}
else if (d1 >= d && d2 >= d && d3 >= d && d4 < d) {
add_edge(i + n, j);
add_edge(j + n, i);
}
else if (d1 >= d && d2 >= d && d3 < d && d4 >= d) {
add_edge(i + n, j + n);
add_edge(j, i);
}
else if (d1 >= d && d2 < d && d3 >= d && d4 >= d) {
add_edge(i, j);
add_edge(j + n, i + n);
}
//else if (d1 < d && d2 >= d && d3 >= d && d4 >= d) {
else {
add_edge(i, j + n);
add_edge(j, i + n);
}
}
StronglyConnectedComponent();
rep(i, n) if (cmp[i] == cmp[i + n]) return false;
return true;
}
static const int INF = 0x3f3f3f3f;
signed main() {
cin >> n;
V = 2 * n;
x.resize(n), y.resize(n);
rep(i, n) scanf("%d%d", &x[i], &y[i]);
int l = 0, r = 10e8 / (n - 1) + 10;
while (r - l > 1) {
int mid = (l + r) / 2;
//OUT(r);
//OUT(l);
//OUT(mid);
if (B(mid)) l = mid;
else r = mid;
}
cout << l << endl;
return 0;
}
Submission Info
Submission Time
2017-06-23 12:25:34+0900
Task
F - Flags
User
KokiYmgch
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
5515 Byte
Status
TLE
Exec Time
5342 ms
Memory
1015552 KB
Compile Error
./Main.cpp: In function ‘int in()’:
./Main.cpp:12:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int in() { int x; scanf("%d", &x); return x; }
^
./Main.cpp: In function ‘long long int lin()’:
./Main.cpp:13:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
long long lin() { long long x; scanf("%lld", &x); return x; }
^
./Main.cpp: In function ‘int main()’:
./Main.cpp:137:46: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
rep(i, n) scanf("%d%d", &x[i], &y[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 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
3 ms
1280 KB
00_example_02.txt
AC
3 ms
1280 KB
00_example_03.txt
AC
3 ms
1280 KB
01.txt
AC
10 ms
1408 KB
02.txt
AC
4 ms
1280 KB
03.txt
AC
3 ms
1280 KB
04.txt
AC
3 ms
1280 KB
05.txt
AC
3 ms
1280 KB
06.txt
AC
2705 ms
9216 KB
07.txt
AC
2840 ms
7936 KB
08.txt
AC
2779 ms
11136 KB
09.txt
AC
12 ms
1408 KB
10.txt
AC
5 ms
1280 KB
11.txt
AC
3 ms
1280 KB
12.txt
AC
3 ms
1280 KB
13.txt
AC
3 ms
1280 KB
14.txt
AC
3184 ms
3072 KB
15.txt
AC
3390 ms
3072 KB
16.txt
AC
3392 ms
3072 KB
17.txt
AC
27 ms
2560 KB
18.txt
AC
8 ms
1536 KB
19.txt
TLE
5274 ms
275840 KB
20.txt
TLE
5275 ms
278400 KB
21.txt
AC
602 ms
13952 KB
22.txt
AC
463 ms
10496 KB
23.txt
AC
13 ms
2944 KB
24.txt
TLE
5314 ms
750848 KB
25.txt
TLE
5314 ms
746984 KB
26.txt
TLE
5342 ms
1015552 KB
27.txt
AC
3 ms
1280 KB