답안 #49193 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
49193	2018-05-23T14:23:02 Z	Benq	고속도로 설계 (CEOI12_highway)	C++14	60 / 100	5 ms	1852 KB

highway

#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"

extern int GetN(); /* {
    return 8;
}

int get (int x) {
    if (x == 1 || x == 3 || x == 4) return 0;
    return 1;
}

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;
}*/

extern void Answer(int a1, int b1, int a2, int b2); /* {
    cout << a1 << " " << b1 << " " << a2 << " " << b2 << "\n";
}*/

int N = GetN();

void solve3(int i, int j, int k) {
    vi posi, cans; 
    FOR(i,4,N+1) posi.pb(i);
    
    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]);
                if (!isOnLine(i,j,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;
        }
    }
    
    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]);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    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); 
        exit(0);
        
    }
}

// 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

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);
     ~~~~~^~~~~~~~~~~

Subtask #1
60.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct - 21 queries, 4 points
2	Correct	2 ms	488 KB	Output is correct - 11 queries, 4 points
3	Correct	3 ms	488 KB	Output is correct - 157 queries, 4 points
4	Incorrect	3 ms	600 KB	Output isn't correct - Protocol error
5	Correct	2 ms	708 KB	Output is correct - 252 queries, 4 points
6	Incorrect	3 ms	708 KB	Output isn't correct - Protocol error
7	Correct	2 ms	708 KB	Output is correct - 351 queries, 4 points
8	Correct	2 ms	708 KB	Output is correct - 401 queries, 4 points
9	Correct	3 ms	800 KB	Output is correct - 451 queries, 4 points
10	Incorrect	2 ms	800 KB	Output isn't correct - Protocol error
11	Correct	3 ms	800 KB	Output is correct - 1002 queries, 4 points
12	Incorrect	2 ms	800 KB	Output isn't correct - Protocol error
13	Correct	2 ms	800 KB	Output is correct - 1503 queries, 4 points
14	Incorrect	3 ms	800 KB	Output isn't correct - Protocol error
15	Correct	3 ms	800 KB	Output is correct - 2504 queries, 4 points
16	Incorrect	3 ms	800 KB	Output isn't correct - Protocol error
17	Correct	3 ms	800 KB	Output is correct - 855 queries, 4 points
18	Correct	2 ms	800 KB	Output is correct - 901 queries, 4 points
19	Incorrect	2 ms	1020 KB	Output isn't correct - Protocol error
20	Correct	3 ms	1152 KB	Output is correct - 15001 queries, 4 points
21	Incorrect	3 ms	1408 KB	Output isn't correct - Protocol error
22	Incorrect	3 ms	1456 KB	Output isn't correct - Protocol error
23	Incorrect	4 ms	1756 KB	Output isn't correct - Protocol error
24	Correct	4 ms	1756 KB	Output is correct - 40945 queries, 4 points
25	Correct	5 ms	1852 KB	Output is correct - 50000 queries, 4 points

답안 #49193

Compilation message

Subtask #1 60.0 / 100.0

Subtask #1
60.0 / 100.0