Submission #49198

#TimeUsernameProblemLanguageResultExecution timeMemory
49198BenqHighway design (CEOI12_highway)C++14
100 / 100
4 ms1660 KiB
#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)

office.c: In function 'int isOnLine(int, int, int)':
office.c:85:29: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
     _Fin(0, "Protocol error");
                             ^
office.c:88:29: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
     _Fin(0, "Protocol error");
                             ^
office.c:92:37: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
     _Fin(false, "Too many questions");
                                     ^
office.c:83:7: warning: unused variable 'i' [-Wunused-variable]
   int i;
       ^
office.c: In function 'void Answer(int, int, int, int)':
office.c:123:29: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
     _Fin(0, "Protocol error");
                             ^
office.c:128:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
       if( (-_Apa[na1]==_N-3) && (na2!=na1) && (nb2!=na1) ||
           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:130:30: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
          _Fin(true, "Correct");
                              ^
office.c:132:36: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
          _Fin(false, "Wrong answer");
                                    ^
office.c:134:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
       if( (-_Apa[na2]==_N-3) && (na1!=na2) && (nb1!=na2) ||
           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:136:30: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
          _Fin(true, "Correct");
                              ^
office.c:138:36: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
          _Fin(false, "Wrong answer");
                                    ^
office.c:140:33: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
       _Fin(false, "Wrong answer");
                                 ^
office.c:142:23: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   _Fin(true, "Correct");
                       ^
office.c:120:27: warning: unused variable 'pont' [-Wunused-variable]
   int na1, nb1, na2, nb2, pont;
                           ^~~~
office.c: In function 'void _doInit()':
office.c:33:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &_N);
     ~~~~~^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...