| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1076161 | c2zi6 | Longest Trip (IOI23_longesttrip) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "soccer.h"
int n;
VVI a;
VPI harevan(int x, int y) {
VPI ret;
if (x) ret.pb({x-1, y});
if (x<n-1) ret.pb({x+1, y});
if (y) ret.pb({x, y-1});
if (y<n-1) ret.pb({x, y+1});
return ret;
}
VVI vis;
void dfs(int x, int y) {
vis[x][y] = true;
for (auto[vx, vy] : harevan(x, y)) if (!vis[vx][vy]) {
if (a[vx][vy] == 1) continue;
dfs(vx, vy);
}
}
bool can1(int ux, int uy, int vx, int vy) {
if (a[ux][uy] == 1) return false;
if (ux < vx) return can1(ux+1, uy, vx, vy);
if (ux > vx) return can1(ux-1, uy, vx, vy);
if (uy < vy) return can1(ux, uy+1, vx, vy);
if (uy > vy) return can1(ux, uy-1, vx, vy);
return true;
}
bool can2(int ux, int uy, int vx, int vy) {
if (a[ux][uy] == 1) return false;
if (uy < vy) return can2(ux, uy+1, vx, vy);
if (uy > vy) return can2(ux, uy-1, vx, vy);
if (ux < vx) return can2(ux+1, uy, vx, vy);
if (ux > vx) return can2(ux-1, uy, vx, vy);
return true;
}
bool can(int ux, int uy, int vx, int vy) {
return can1(ux, uy, vx, vy) || can2(ux, uy, vx, vy);
}
int biggest_stadium(int N, VVI A_ARG) {
n = N;
a = A_ARG;
rep(_, 0) {
int x, y;
int cnt = 0;
rep(i, n) rep(j, n) if (a[i][j] == 1) x = i, y = j, cnt++;
if (cnt == 0) return n*n;
if (cnt > 1) break;
int ans = 0;
setmax(ans, n*n - (x+1)*(y+1));
setmax(ans, n*n - (x+1)*(n-y));
setmax(ans, n*n - (n-x)*(y+1));
setmax(ans, n*n - (n-x)*(n-y));
return ans;
}
if (true) {
rep(ux, n) rep(uy, n) if (a[ux][uy] == 0) {
rep(vx, n) rep(vy, n) if (a[vx][vy] == 0) {
if (can(ux, uy, vx, vy));
else {
return 0;
}
}
}
int ans = 0;
rep(i, n) rep(j, n) if (a[i][j] == 0) ans++;
return ans;
return 0;
}
VVI el, er, eu, ed;
el = er = eu = ed = VVI(n, VI(n));
rep(i, n) {
bool f;
f = false;
replr(j, 0, n-1) {
if (a[i][j] == 0) f = true;
el[i][j] = f;
}
f = false;
reprl(j, n-1, 0) {
if (a[i][j] == 0) f = true;
er[i][j] = f;
}
}
rep(j, n) {
bool f;
f = false;
replr(i, 0, n-1) {
if (a[i][j] == 0) f = true;
eu[i][j] = f;
}
f = false;
reprl(i, n-1, 0) {
if (a[i][j] == 0) f = true;
ed[i][j] = f;
}
}
int comp = 0;
vis = VVI(n, VI(n));
rep(i, n) rep(j, n) if (a[i][j] == 0 && !vis[i][j]) {
dfs(i, j);
comp++;
}
if (comp > 1) return 0;
rep(i, n) rep(j, n) {
if (a[i][j] == 1) {
if (ed[i][j] && eu[i][j]) return 0;
if (el[i][j] && er[i][j]) return 0;
}
}
/*cout << "ed" << endl;*/
/*rep(i, n) {*/
/* rep(j, n) cout << ed[i][j] << " ";*/
/* cout << endl;*/
/*}*/
/*cout << "eu" << endl;*/
/*rep(i, n) {*/
/* rep(j, n) cout << eu[i][j] << " ";*/
/* cout << endl;*/
/*}*/
int ans = 0;
rep(i, n) rep(j, n) if (a[i][j] == 0) ans++;
return ans;
}