| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 229602 | Vimmer | Duathlon (APIO18_duathlon) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) ll(x.size())
#define pb push_back
#define N 500005
#define MOD ll(998244353)
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef short int si;
//typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
vector <pair <pair <int, int>, int> > g;
map <int, int> mpx, mpy;
vector <int> xr, yr;
int xs[N], ys[N];
ll t[N * 4], psh[N * 4];
set <pair <int, int> > se;s
int main()
{
// freopen("input.txt", "r", stdin);// freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
int a, b, c;
cin >> a >> b >> c;
g.pb({{a, b}, c});
xr.pb(a);
yr.pb(b);
se.insert({a, b});
}
sort(g.begin(), g.end());
sort(xr.begin(), xr.end());
sort(yr.begin(), yr.end());
int id = 1;
for (auto it : xr)
{
if (mpx.find(it) != mpx.end()) continue;
mpx[it] = id++;
}
id = 1;
for (auto it : yr)
{
if (mpy.find(it) != mpy.end()) continue;
mpy[it] = id++;
}
for (int i = 0; i < n; i++)
{
xs[i] = mpx[g[i].F.F];
ys[i] = mpy[g[i].F.S];
}
ll ans = 0, ax, ay, xa, ya;
int x = 2 * 1e9, y = 2 * 1e9;
while (1)
{
if (se.find({x, y}) == se.end())
{
ax = xa = x;
ay = ya = y;
break;
}
x--;
}
cout << ans << endl;
cout << ax << " " << ay << " " << xa << " " << ya << endl;
}