Submission #286389

# Submission time Handle Problem Language Result Execution time Memory
286389 2020-08-30T10:59:49 Z Kastanda Highway design (CEOI12_highway) C++11
100 / 100
1 ms 768 KB
// M
#include<bits/stdc++.h>
#include "office.h"
using namespace std;
const int N = 100005;
int main()
{
        int n = GetN();

        if (isOnLine(1, 2, 3))
        {
                vector < int > vec;
                for (int i = 4; i + 1 <= n && (int)vec.size() <= 1; i += 2)
                        if (!isOnLine(1, i, i + 1))
                                vec.push_back(i);
                if ((int)vec.size() == 2)
                {
                        int a = vec[0] + (int)isOnLine(1, 2, vec[0]);
                        int b = vec[1] + (int)isOnLine(1, 2, vec[1]);
                        Answer(1, 2, a, b);
                        return 0;
                }
                assert((int)vec.size());
                if (n % 2 == 1)
                {
                        Answer(1, 2, vec[0], vec[0] + 1);
                        return 0;
                }
                if (isOnLine(1, 2, vec[0]))
                {
                        Answer(1, 2, vec[0] + 1, n);
                        return 0;
                }
                if (isOnLine(1, 2, vec[0] + 1))
                {
                        Answer(1, 2, vec[0], n);
                        return 0;
                }
                Answer(1, 2, vec[0], vec[0] + 1);
                return 0;
        }
        int traitor = -1;
        if (isOnLine(1, 2, 4))
                traitor = 3;
        else if (isOnLine(1, 3, 4))
                traitor = 2;
        else if (isOnLine(2, 3, 4))
                traitor = 1;

        if (traitor == -1)
        {
                for (int i = 1; i <= 4; i ++)
                        for (int j = i + 1; j <= 4; j ++)
                                if (isOnLine(i, j, 5))
                                {
                                        int a = 1;
                                        while (a == i || a == j)
                                                a ++;
                                        int b = a + 1;
                                        while (b == i || b == j)
                                                b ++;
                                        Answer(i, j, a, b);
                                        return 0;
                                }
        }

        int good_samaritan_1 = (traitor == 1) ? 2 : 1;
        int good_samaritan_2 = (traitor <= 2) ? 3 : 2;
        vector < int > vec;
        for (int i = 5; i + 1 <= n && !(int)vec.size(); i += 2)
                if (!isOnLine(good_samaritan_1, i, i + 1))
                        vec.push_back(i);
        if (!(int)vec.size())
        {
                assert(n % 2 == 1);
                Answer(good_samaritan_1, good_samaritan_2, traitor, n);
                return 0;
        }
        if (isOnLine(good_samaritan_1, good_samaritan_2, vec[0]))
                Answer(good_samaritan_1, good_samaritan_2, traitor, vec[0] + 1);
        else
                Answer(good_samaritan_1, good_samaritan_2, traitor, vec[0]);
        return 0;
}

Compilation message

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);
      |     ~~~~~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct - 21 queries, 4 points
2 Correct 0 ms 256 KB Output is correct - 11 queries, 4 points
3 Correct 0 ms 256 KB Output is correct - 157 queries, 4 points
4 Correct 0 ms 256 KB Output is correct - 202 queries, 4 points
5 Correct 0 ms 384 KB Output is correct - 252 queries, 4 points
6 Correct 0 ms 256 KB Output is correct - 303 queries, 4 points
7 Correct 0 ms 256 KB Output is correct - 351 queries, 4 points
8 Correct 0 ms 256 KB Output is correct - 401 queries, 4 points
9 Correct 0 ms 256 KB Output is correct - 451 queries, 4 points
10 Correct 0 ms 256 KB Output is correct - 502 queries, 4 points
11 Correct 0 ms 384 KB Output is correct - 1002 queries, 4 points
12 Correct 0 ms 384 KB Output is correct - 1003 queries, 4 points
13 Correct 1 ms 384 KB Output is correct - 1503 queries, 4 points
14 Correct 1 ms 384 KB Output is correct - 2004 queries, 4 points
15 Correct 1 ms 384 KB Output is correct - 2504 queries, 4 points
16 Correct 0 ms 256 KB Output is correct - 805 queries, 4 points
17 Correct 0 ms 384 KB Output is correct - 855 queries, 4 points
18 Correct 0 ms 256 KB Output is correct - 901 queries, 4 points
19 Correct 1 ms 384 KB Output is correct - 12707 queries, 4 points
20 Correct 1 ms 384 KB Output is correct - 15001 queries, 4 points
21 Correct 1 ms 512 KB Output is correct - 20062 queries, 4 points
22 Correct 1 ms 512 KB Output is correct - 28063 queries, 4 points
23 Correct 1 ms 640 KB Output is correct - 33890 queries, 4 points
24 Correct 1 ms 640 KB Output is correct - 40945 queries, 4 points
25 Correct 1 ms 768 KB Output is correct - 50000 queries, 4 points