oj.uz

Submission #226095

# Submission time Handle Problem Language Result Execution time Memory
226095 2020-04-22T14:09:47 Z Andrei_Cotor Highway design (CEOI12_highway) C++11
100 / 100
 6 ms 640 KB 
#include"office.h"

using namespace std;

int Comb[][3]={
{1,2,3},
{1,2,4},
{1,3,4},
{2,3,4}};

int main()
{
    int n=GetN();

    int found=-1;
    for(int i=0; i<=4; i++)
    {
        if(isOnLine(Comb[i][0],Comb[i][1],Comb[i][2]))
        {
            found=i;
            break;
        }
    }

    if(found==-1) //intre primele 4 sunt 2 de pe prima dreapta si 2 de pe a doua
    {
        for(int i=1; i<=3; i++)
        {
            for(int j=i+1; j<=4; j++)
            {
                if(isOnLine(i,j,5)) //5 va fi al treilea element de pe una dintre drepte
                {
                    int x=0,y=0;
                    for(int k=1; k<=4; k++)
                    {
                        if(k!=i && k!=j)
                        {
                            if(x==0)
                                x=k;
                            else
                                y=k;
                        }
                    }

                    Answer(i,j,x,y);
                }
            }
        }
    }
    //altfel am cel putin 3 puncte de pe o dreapta

    if(found==0) //nu se stie daca apar puncte de pe a doua dreapta in primele 4
    {
        int x=0;
        int y=0;
        for(int i=4; i<n; i+=2)
        {
            if(!isOnLine(Comb[found][0],i,i+1))
            {
                int aux;
                if(isOnLine(Comb[found][0],Comb[found][1],i))
                    aux=i+1;
                else
                    aux=i;

                if(x==0)
                    x=aux;
                else
                    y=aux;
            }
        }

        if(n%2==0 && y==0)
            y=n;

        Answer(Comb[found][0],Comb[found][1],x,y);
    }
    else
    {
        int x=1^2^3^4^Comb[found][0]^Comb[found][1]^Comb[found][2];
        for(int i=5; i<n-2; i+=2)
        {
            if(!isOnLine(Comb[found][0],i,i+1))
            {
                if(isOnLine(Comb[found][0],Comb[found][1],i))
                    Answer(Comb[found][0],Comb[found][1],x,i+1);
                else
                    Answer(Comb[found][0],Comb[found][1],x,i);
            }
        }

        if(n%2==1)
        {
            if(!isOnLine(Comb[found][0],Comb[found][1],n-2))
                Answer(Comb[found][0],Comb[found][1],x,n-2);
            else
                Answer(Comb[found][0],Comb[found][1],x,n);
        }
        else
        {
            //ultimele 2 sunt sigur pe dreapta 2
            Answer(Comb[found][0],Comb[found][1],x,n);
        }
    }
    return 0;
}

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

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