| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 49198 | Benq | Highway design (CEOI12_highway) | C++14 | 4 ms | 1660 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.
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
#include "office.h"
int tmp[101];
extern int GetN(); /* {
return 10;
}*/
/*
int get (int x) {
return tmp[x];
}*/
int bad = 0;
extern int isOnLine(int x, int y, int z); /* \{
bad ++;
if (get(x) != get(y)) return 0;
if (get(x) != get(z)) return 0;
return 1;
}*/
int N = GetN();
extern void Answer(int a1, int b1, int a2, int b2); /* {
// if (N/2+2 < bad) {
cout << a1 << " " << b1 << " " << a2 << " " << b2 << "\n";
cout << N << " " << N/2+2 << " " << bad << " " << tmp[a1] << " " << tmp[b1] << " " << tmp[a2] << " " << tmp[b2] << "\n";
// }
}*/
void solve3(int i, int j, int k) {
vi posi, cans;
FOR(i,4,N+1) posi.pb(i);
reverse(all(posi));
while (sz(cans) < 2) {
if (sz(posi) == 1) {
cans.pb(posi[0]);
Answer(i,j,cans[0],cans[1]);
return;
}
if (!isOnLine(i,posi[sz(posi)-1],posi[sz(posi)-2])) {
if (!isOnLine(i,j,posi[sz(posi)-1])) {
cans.pb(posi[sz(posi)-1]);
/*if (!isOnLine(i,j,posi[sz(posi)-2])) {
cans.pb(posi[sz(posi)-2]);
}*/
} else {
cans.pb(posi[sz(posi)-2]);
}
}
posi.pop_back();
posi.pop_back();
if (sz(cans) > 1) {
Answer(i,j,cans[0],cans[1]);
return;
}
}
cout << "OOPS\n";
/*for (int x: posi) cans.pb(x);
Answer(i,j,cans[0],cans[1]);*/
}
void solve4(int i, int j, int k) {
vi posi, cans;
FOR(i,5,N+1) posi.pb(i);
cans.pb(1+2+3+4-i-j-k);
while (sz(posi)+sz(cans) > 2) {
if (!isOnLine(i,posi[sz(posi)-1],posi[sz(posi)-2])) {
if (!isOnLine(i,j,posi[sz(posi)-1])) {
cans.pb(posi[sz(posi)-1]);
} else {
cans.pb(posi[sz(posi)-2]);
}
}
posi.pop_back();
posi.pop_back();
if (sz(cans) > 1) {
Answer(i,j,cans[0],cans[1]);
return;
}
}
for (int x: posi) cans.pb(x);
Answer(i,j,cans[0],cans[1]);
}
void solve5(int i, int j, int k) {
vi v;
FOR(x,1,6) if (x != i && x != j && x != k) v.pb(x);
Answer(i,j,v[0],v[1]);
}
void gen() {
bad = 0;
while (1) {
N = 6;
FOR(i,1,N-2) tmp[i] = 0;
FOR(i,N-2,N+1) tmp[i] = 1;
/*int t = 0;
FOR(i,1,N+1) t += tmp[i];
if (t >= 3 && t <= N-3) break;*/
break;
}
}
void solve() {
FOR(i,3,6) FOR(j,1,i) FOR(k,1,j) if (isOnLine(i,j,k)) {
if (i == 3) solve3(i,j,k);
else if (i == 4) solve4(i,j,k);
else solve5(i,j,k);
return;
}
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
solve();
}
// read the question correctly (is y a vowel? what are the exact constraints?)
// look out for SPECIAL CASES (n=1?) and overflow (ll vs int?)
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||