oj.uz

Submission #262224

# Submission time Handle Problem Language Result Execution time Memory
262224 2020-08-12T13:41:45 Z georgerapeanu Highway design (CEOI12_highway) C++11
100 / 100
 36 ms 6136 KB 
#include "office.h"
#pragma once
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>

using namespace std;

int n;

map<vector<int>,bool> mp;

bool ok(int a,int b,int c){
    vector<int> tmp = {a,b,c};
    sort(tmp.begin(),tmp.end());
    if(mp.count(tmp) == 0){
//        printf("asking %d %d %d\n",a,b,c);
        mp[tmp] = isOnLine(a,b,c);
//        printf("got %d\n",mp[tmp]);
    }
    return mp[tmp];
}

int main(){
    n = GetN();


    int a = ok(1,2,3);
    if(a == 1){
        vector<int> fst = {1,2};
        vector<int> snd = {};
        for(int i = 4;i <= n && snd.size() <= 2;i += 2){
            if(i + 1 > n || ok(1,i,i + 1) == 0){
                if(i + 1 <= n && ok(1,2,i)){
                    snd.push_back(i + 1);
                }
                else{
                    snd.push_back(i);
                }
            }
        }
        Answer(fst[0],fst[1],snd[0],snd[1]);
        return 0;
    }
    int b = ok(4,5,6);

    if(b == 1){
        vector<int> fst = {4,5};
        vector<int> snd = {};
        for(int i = 1;i <= 3;i++){
            if(ok(4,5,i) == 0){
                snd.push_back(i);
            }
        }
        if(snd.size() > 1){
            Answer(fst[0],fst[1],snd[0],snd[1]);
            return 0;
        }
        for(int i = 7;i <= n && snd.size() <= 2;i += 2){
            if(i + 1 > n || ok(fst[0],i,i + 1) == 0){
                if(i + 1 <= n && ok(fst[0],fst[1],i)){
                    snd.push_back(i + 1);
                }
                else{
                    snd.push_back(i);
                }
            }
        }
        Answer(fst[0],fst[1],snd[0],snd[1]);
        return 0;
            
    }
    else{
        int x,y,z;
        for(int i = 1;i <= 6;i++){
            for(int j = i + 1;j <= 6;j++){
                for(int k = j + 1;k <= 6;k++){
                    if(ok(i,j,k)){
                        x = i;
                        y = j;
                        z = k;
                        goto done1;
                    }
                }
            }
        }
        done1:
        vector<int> fst = {x,y};
        vector<int> snd = {};
        for(int i = 1;i <= 6;i++){
            if(i != x && i != y && i != z && ok(x,y,i) == false){
                snd.push_back(i);
            }
        }
        Answer(fst[0],fst[1],snd[0],snd[1]);
        return 0;
    }
    return 0;
}

Compilation message

highway.cpp:2:9: warning: #pragma once in main file
    2 | #pragma once
      |         ^~~~
highway.cpp: In function 'int main()':
highway.cpp:92:33: warning: 'z' may be used uninitialized in this function [-Wmaybe-uninitialized]
   92 |             if(i != x && i != y && i != z && ok(x,y,i) == false){
      |                ~~~~~~~~~~~~~~~~~^~~~~~~~~
highway.cpp:92:48: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
   92 |             if(i != x && i != y && i != z && ok(x,y,i) == false){
      |                                              ~~^~~~~~~
highway.cpp:92:48: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
office.c: In function 'int isOnLine(int, int, int)':
office.c:85:13: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   85 |     _Fin(0, "Protocol error");
      |             ^~~~~~~~~~~~~~~~
office.c:88:13: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   88 |     _Fin(0, "Protocol error");
      |             ^~~~~~~~~~~~~~~~
office.c:92:17: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   92 |     _Fin(false, "Too many questions");
      |                 ^~~~~~~~~~~~~~~~~~~~
office.c:83:7: warning: unused variable 'i' [-Wunused-variable]
   83 |   int i;
      |       ^
office.c: In function 'void Answer(int, int, int, int)':
office.c:123:13: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  123 |     _Fin(0, "Protocol error");
      |             ^~~~~~~~~~~~~~~~
office.c:128:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  128 |       if( (-_Apa[na1]==_N-3) && (na2!=na1) && (nb2!=na1) ||
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:130:21: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  130 |          _Fin(true, "Correct");
      |                     ^~~~~~~~~
office.c:132:22: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  132 |          _Fin(false, "Wrong answer");
      |                      ^~~~~~~~~~~~~~
office.c:134:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  134 |       if( (-_Apa[na2]==_N-3) && (na1!=na2) && (nb1!=na2) ||
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:136:21: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  136 |          _Fin(true, "Correct");
      |                     ^~~~~~~~~
office.c:138:22: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  138 |          _Fin(false, "Wrong answer");
      |                      ^~~~~~~~~~~~~~
office.c:140:19: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  140 |       _Fin(false, "Wrong answer");
      |                   ^~~~~~~~~~~~~~
office.c:142:14: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  142 |   _Fin(true, "Correct");
      |              ^~~~~~~~~
office.c:120:27: warning: unused variable 'pont' [-Wunused-variable]
  120 |   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]
   33 |     scanf("%d", &_N);
      |     ~~~~~^~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct - 20 queries, 4 points
2 Correct 0 ms 256 KB Output is correct - 10 queries, 4 points
3 Correct 0 ms 256 KB Output is correct - 156 queries, 4 points
4 Correct 0 ms 384 KB Output is correct - 202 queries, 4 points
5 Correct 0 ms 384 KB Output is correct - 251 queries, 4 points
6 Correct 1 ms 384 KB Output is correct - 303 queries, 4 points
7 Correct 0 ms 384 KB Output is correct - 350 queries, 4 points
8 Correct 0 ms 384 KB Output is correct - 400 queries, 4 points
9 Correct 0 ms 384 KB Output is correct - 450 queries, 4 points
10 Correct 1 ms 384 KB Output is correct - 502 queries, 4 points
11 Correct 1 ms 384 KB Output is correct - 1001 queries, 4 points
12 Correct 1 ms 384 KB Output is correct - 1003 queries, 4 points
13 Correct 1 ms 512 KB Output is correct - 1502 queries, 4 points
14 Correct 1 ms 512 KB Output is correct - 2004 queries, 4 points
15 Correct 2 ms 640 KB Output is correct - 2503 queries, 4 points
16 Correct 1 ms 384 KB Output is correct - 805 queries, 4 points
17 Correct 1 ms 384 KB Output is correct - 854 queries, 4 points
18 Correct 1 ms 384 KB Output is correct - 900 queries, 4 points
19 Correct 8 ms 1792 KB Output is correct - 12707 queries, 4 points
20 Correct 9 ms 2048 KB Output is correct - 15000 queries, 4 points
21 Correct 15 ms 2688 KB Output is correct - 20062 queries, 4 points
22 Correct 18 ms 3584 KB Output is correct - 28063 queries, 4 points
23 Correct 23 ms 4224 KB Output is correct - 33890 queries, 4 points
24 Correct 36 ms 5112 KB Output is correct - 40944 queries, 4 points
25 Correct 34 ms 6136 KB Output is correct - 49999 queries, 4 points