답안 #105414

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
105414 2019-04-12T04:59:02 Z alexpetrescu 고속도로 설계 (CEOI12_highway) C++14
100 / 100
4 ms 640 KB
#include <cstdio>
#include <algorithm>
#include "office.h"

inline void solve(int n, int a, int b, int c, int d) {
    int e = 0, f = 0, poz = 6;
    while (poz + 1 <= n && e == 0) {
        if (!isOnLine(1, poz, poz + 1)) {
            if (c == 0)
                c = poz, d = poz + 1;
            else
                e = poz, f = poz + 1;
        }
        poz += 2;
    }
    if (e == 0)
        Answer(1, a, c, d);
    else {
        if (isOnLine(1, a, c))
            c = d;
        if (isOnLine(1, a, e))
            e = f;
        Answer(1, a, c, e);
    }
}

int main() {
    int n = GetN();
    int A = isOnLine(1, 2, 3), B = isOnLine(1, 4, 5);
    if (A || B) {
        int doi = 2, trei = 3, patru = 4, cinci = 5;
        if (!A) {
            std::swap(doi, patru);
            std::swap(trei, cinci);
        }
        if (B)
            solve(n, doi, trei, 0, 0);
        else
            solve(n, doi, trei, patru, cinci);
        return 0;
    }
    if (isOnLine(2, 3, 4)) {
        int poz = 6;
        while (poz + 1 <= n && isOnLine(2, poz, poz + 1))
            poz += 2;
        if (poz + 1 <= n) {
            if (isOnLine(2, 3, poz))
                Answer(1, poz + 1, 2, 3);
            else
                Answer(1, poz, 2, 3);
        } else
            Answer(1, 5, 2, 3);
    } else {
        if (isOnLine(1, 2, 4))
            Answer(1, 2, 3, 5);
        if (isOnLine(1, 2, 5))
            Answer(1, 2, 3, 4);
        if (isOnLine(1, 3, 4))
            Answer(1, 3, 2, 5);
        if (isOnLine(1, 3, 5))
            Answer(1, 3, 2, 4);
        if (isOnLine(2, 3, 5))
            Answer(1, 4, 2, 3);
        if (isOnLine(2, 4, 5))
            Answer(1, 3, 2, 4);
        if (isOnLine(3, 4, 5))
            Answer(1, 2, 3, 4);
    }
}

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);
     ~~~~~^~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct - 19 queries, 4 points
2 Correct 2 ms 256 KB Output is correct - 9 queries, 4 points
3 Correct 2 ms 256 KB Output is correct - 155 queries, 4 points
4 Correct 2 ms 256 KB Output is correct - 202 queries, 4 points
5 Correct 2 ms 256 KB Output is correct - 250 queries, 4 points
6 Correct 2 ms 384 KB Output is correct - 303 queries, 4 points
7 Correct 2 ms 384 KB Output is correct - 349 queries, 4 points
8 Correct 2 ms 256 KB Output is correct - 399 queries, 4 points
9 Correct 2 ms 384 KB Output is correct - 449 queries, 4 points
10 Correct 2 ms 256 KB Output is correct - 502 queries, 4 points
11 Correct 2 ms 256 KB Output is correct - 1000 queries, 4 points
12 Correct 2 ms 256 KB Output is correct - 1003 queries, 4 points
13 Correct 2 ms 256 KB Output is correct - 1501 queries, 4 points
14 Correct 3 ms 256 KB Output is correct - 2004 queries, 4 points
15 Correct 2 ms 256 KB Output is correct - 2502 queries, 4 points
16 Correct 2 ms 256 KB Output is correct - 805 queries, 4 points
17 Correct 4 ms 384 KB Output is correct - 853 queries, 4 points
18 Correct 2 ms 384 KB Output is correct - 899 queries, 4 points
19 Correct 2 ms 384 KB Output is correct - 12707 queries, 4 points
20 Correct 3 ms 384 KB Output is correct - 14999 queries, 4 points
21 Correct 3 ms 512 KB Output is correct - 20062 queries, 4 points
22 Correct 2 ms 512 KB Output is correct - 28063 queries, 4 points
23 Correct 2 ms 512 KB Output is correct - 33890 queries, 4 points
24 Correct 4 ms 640 KB Output is correct - 40943 queries, 4 points
25 Correct 4 ms 640 KB Output is correct - 49998 queries, 4 points