| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 949638 | GrindMachine | Highway design (CEOI12_highway) | C++17 | 1 ms | 1500 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/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "office.h"
int f(int x, int y, int z){
return isOnLine(x,y,z);
}
void solve(int test_case)
{
int n = GetN();
int res1 = f(1,2,3);
vector<int> a,b;
rep1(i,n) b.pb(i);
if(!res1){
int res2 = f(4,5,6);
if(!res2){
// brute force
vector<int> c;
bool g[7][7][7];
memset(g,0,sizeof g);
rep1(i,6){
for(int j = i+1; j <= 6; ++j){
for(int k = j+1; k <= 6; ++k){
g[i][j][k] = f(i,j,k);
if(c.empty() and g[i][j][k]){
c = {i,j,k};
}
}
}
}
rep1(i,6){
if(count(all(c),i)) conts;
vector<int> ord = {c[0],c[1],i};
sort(all(ord));
if(g[ord[0]][ord[1]][ord[2]]){
c.pb(i);
}
}
vector<int> d;
rep1(i,6) d.pb(i);
trav(x,c){
d.erase(find(all(d),x));
}
assert(sz(d) >= 2);
Answer(c[0],c[1],d[0],d[1]);
return;
}
for(int i = 4; i <= 6; ++i){
b.erase(find(all(b),i));
a.pb(i);
}
}
else{
for(int i = 1; i <= 3; ++i){
b.erase(find(all(b),i));
a.pb(i);
}
}
vector<int> c;
// trav(x,b) cout << x << " ";
// cout << endl;
while(true){
int x = b[sz(b)-1], y = b[sz(b)-2];
if(f(a[0],x,y)){
b.pop_back();
b.pop_back();
conts;
}
if(f(a[0],a[1],x)){
c.pb(y);
b.pop_back(), b.pop_back();
}
else{
c.pb(x);
b.pop_back();
}
if(sz(c) >= 2){
Answer(a[0],a[1],c[0],c[1]);
return;
}
}
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||