# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
117336 | 2019-06-15T13:49:55 Z | JohnTitor | 고속도로 설계 (CEOI12_highway) | C++11 | 5 ms | 2424 KB |
#include <bits/stdc++.h> using namespace std; #define FOR(i, j, k) for(int i=(j); i<=(k); i++) #define FFOR(i, j, k) for(int i=(j); i<(k); i++) #define DFOR(i, j, k) for(int i=(j); i>=(k); i--) #define bug(x) cerr<<#x<<" = "<<(x)<<'\n' #define pb push_back #define mp make_pair #define bit(s, i) (((s)>>(i))&1LL) #define mask(i) ((1LL<<(i))) #define builtin_popcount __builtin_popcountll #define __builtin_popcount __builtin_popcountll using ll=long long; using ld=long double; mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const ld pi=acos(0)*2; template <typename T> inline void read(T &x){char c; bool nega=0; while((!isdigit(c=getchar()))&&(c!='-')); if(c=='-'){nega=1; c=getchar();} x=c-48; while(isdigit(c=getchar())) x=x*10+c-48; if(nega) x=-x;} template <typename T> inline void writep(T x){if(x>9) writep(x/10); putchar(x%10+48);} template <typename T> inline void write(T x){if(x<0){ putchar('-'); x=-x;} writep(x);} template <typename T> inline void writeln(T x){write(x); putchar('\n');} #define taskname "Highway" #ifdef Aria void Answer(int a, int b, int c, int d){} bool isOnLine(int a, int b, int c){} int GetN(){}; #else #include "office.h" #endif // Aria int n; int a=1; int x, y, z, t; void answer(int a, int b, int c, int d){ assert(a); assert(b); assert(c); assert(d); assert(a!=b); assert(a!=c); assert(a!=d); assert(b!=c); assert(b!=d); assert(c!=d); Answer(a, b, c, d); exit(0); } bool isonline(int a, int b, int c){ assert(a); assert(b); assert(c); assert(a!=b); assert(a!=c); assert(b!=c); return isOnLine(a, b, c); } vector <int> all; int main(){ n=GetN(); FOR(i, 2, n) all.pb(i); bool bad=1; while(true){ int b=all.back(); all.pop_back(); int c=all.back(); all.pop_back(); if(isonline(a, b, c)){ x=b; continue; } else{ int d=all.back(); all.pop_back(); if(isonline(a, b, d)){ x=a; y=b; z=c; } else if(isonline(a, c, d)){ x=a; y=c; z=b; } else{ x=b; y=c; z=a; all.pb(d); } bad=0; break; } } // if(bad) assert(0); while(true){ int p=all.back(); all.pop_back(); int q=all.back(); all.pop_back(); if(isonline(x, p, q)) continue; if(isonline(x, y, p)) t=q; else t=p; break; } answer(x, y, z, t); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Runtime error | 3 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
3 | Runtime error | 3 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
4 | Runtime error | 2 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
5 | Runtime error | 2 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
6 | Runtime error | 3 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
7 | Runtime error | 3 ms | 640 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
8 | Runtime error | 3 ms | 640 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
9 | Runtime error | 2 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
10 | Runtime error | 3 ms | 640 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
11 | Runtime error | 3 ms | 640 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
12 | Runtime error | 3 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
13 | Runtime error | 2 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
14 | Runtime error | 2 ms | 640 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
15 | Runtime error | 3 ms | 768 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
16 | Runtime error | 2 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
17 | Runtime error | 2 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
18 | Runtime error | 2 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
19 | Runtime error | 3 ms | 1152 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
20 | Runtime error | 3 ms | 1152 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
21 | Runtime error | 4 ms | 1404 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
22 | Runtime error | 5 ms | 1660 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
23 | Runtime error | 5 ms | 1784 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
24 | Runtime error | 5 ms | 2168 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
25 | Runtime error | 5 ms | 2424 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |