답안 #23007 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
23007	2017-05-01T10:55:31 Z	Bruteforceman	고속도로 설계 (CEOI12_highway)	C++11	80 / 100	23 ms	5584 KB

highway

#include <bits/stdc++.h>
#include <office.h>
using namespace std;

/*
int isOnLine(int x, int y, int z) {
    return 0;
}
void Answer(int x, int y, int p, int q) {
    return ;
}
int GetN() {
    return 1;
}
*/

map <tuple <int, int, int>, int> mem;
int ask(int x, int y, int z) {
    if(x > y) swap(x, y);
    if(y > z) swap(y, z);
    if(x > y) swap(x, y);
    if(mem.find(make_tuple(x, y, z)) == mem.end()) {
        return mem[make_tuple(x, y, z)] = isOnLine(x, y, z);
    } else {
        return mem[make_tuple(x, y, z)];
    }
}

int main() {
    int n = GetN();
    if(ask(1, 2, 3) == 1) {
        vector <int> can;
        for(int i = 4; i <= n; i += 2) {
            if(can.size() >= 2) break;
            if(i == n) {
                can.push_back(i);
            } else if (ask(1, i, i+1) == 0) {
                if(ask(1, 2, i) == 0) can.push_back(i);
                if(can.size() == 2) break;
                if(ask(1, 2, i+1) == 0) can.push_back(i+1);
                if(can.size() == 2) break;
            }
        }
        Answer(1, 2, can.front(), can.back());
    } else if (ask(3, 4, 5) == 1) {
        vector <int> can;
        if(ask(2, 3, 4) == 1) can.push_back(1);
        else can.push_back(2);

        for(int i = 6; i <= n; i += 2) {
            if(can.size() >= 2) break;
            if(i == n) {
                can.push_back(i);
            } else if (ask(3, i, i+1)) {
                if(ask(3, 4, i) == 0) can.push_back(i);
                if(can.size() == 2) break;
                if(ask(3, 4, i+1) == 0) can.push_back(i+1);
                if(can.size() == 2) break;
            }
        }
        Answer(3, 4, can.front(), can.back());
    } else if (ask(1, 2, 4) == 1) {
        vector <int> can;
        can.push_back(3);

        for(int i = 4; i <= n; i += 2) {
            if(can.size() >= 2) break;
            if(i == n) {
                can.push_back(i);
            } else if (ask(1, i, i+1) == 0) {
                if(ask(1, 2, i) == 0) can.push_back(i);
                if(can.size() == 2) break;
                if(ask(1, 2, i+1) == 0) can.push_back(i+1);
                if(can.size() == 2) break;
            }
        }
        Answer(1, 2, can.front(), can.back());
    } else {
        for(int i = 1; i <= 5; i++) {
            for(int j = i+1; j <= 5; j++) {
                for(int k = j+1; k <= 5; k++) {
                    if(ask(i, j, k) == 1) {
                        vector <int> can;
                        for(int x = 1; x <= 5; x++) {
                            if(x == i || x == j || x == k) continue;
                            can.push_back(x);
                        }
                        Answer(i, j, can.front(), can.back());
                        break;
                    }
                }
            }
        }
    }
};

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:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &_N);
                     ^

Subtask #1
80.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2416 KB	Output is correct - 21 queries, 4 points
2	Correct	0 ms	2416 KB	Output is correct - 11 queries, 4 points
3	Correct	0 ms	2416 KB	Output is correct - 157 queries, 4 points
4	Partially correct	0 ms	2416 KB	Output is partially correct - 203 queries, 2 points
5	Correct	0 ms	2416 KB	Output is correct - 252 queries, 4 points
6	Partially correct	0 ms	2416 KB	Output is partially correct - 304 queries, 2 points
7	Correct	0 ms	2416 KB	Output is correct - 351 queries, 4 points
8	Correct	0 ms	2416 KB	Output is correct - 401 queries, 4 points
9	Correct	0 ms	2416 KB	Output is correct - 451 queries, 4 points
10	Partially correct	0 ms	2416 KB	Output is partially correct - 503 queries, 2 points
11	Correct	0 ms	2548 KB	Output is correct - 1002 queries, 4 points
12	Partially correct	0 ms	2548 KB	Output is partially correct - 1004 queries, 2 points
13	Correct	0 ms	2548 KB	Output is correct - 1503 queries, 4 points
14	Partially correct	0 ms	2548 KB	Output is partially correct - 2005 queries, 2 points
15	Correct	0 ms	2548 KB	Output is correct - 2504 queries, 4 points
16	Partially correct	0 ms	2548 KB	Output is partially correct - 806 queries, 2 points
17	Correct	0 ms	2548 KB	Output is correct - 855 queries, 4 points
18	Correct	0 ms	2548 KB	Output is correct - 901 queries, 4 points
19	Partially correct	3 ms	3208 KB	Output is partially correct - 12708 queries, 2 points
20	Correct	6 ms	3340 KB	Output is correct - 15001 queries, 4 points
21	Partially correct	13 ms	3736 KB	Output is partially correct - 20063 queries, 2 points
22	Partially correct	23 ms	4132 KB	Output is partially correct - 28064 queries, 2 points
23	Partially correct	19 ms	4528 KB	Output is partially correct - 33891 queries, 2 points
24	Correct	19 ms	5056 KB	Output is correct - 40945 queries, 4 points
25	Correct	23 ms	5584 KB	Output is correct - 50000 queries, 4 points

답안 #23007

Compilation message

Subtask #1 80.0 / 100.0

Subtask #1
80.0 / 100.0