oj.uz

답안 #78561

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
78561 2018-10-06T11:13:54 Z hamzqq9 고속도로 설계 (CEOI12_highway) C++14
100 / 100
 5 ms 2236 KB 
#include <stdlib.h>
#include <iostream>
#include <string>
#include "office.h"
#define _MaxN	100001
#include<vector>
using namespace std;
#define pb push_back
int pro[100005];

int main() {

 // freopen("in.txt","r",stdin);

  int n=GetN();

  int g=0;

  vector<int> ans[2];

  for(int i=1;i<n;i+=2) {

    if(i+2<=n) {

     if(isOnLine(i,i+1,i+2)) {

      if(!pro[i]) ans[g].pb(i),pro[i]=1;  
      if(!pro[i+1]) ans[g].pb(i+1),pro[i+1]=1;
      if(!pro[i+2]) ans[g].pb(i+2),pro[i+2]=1;

     }
     else {

        g=!g;
        pro[i+1]=1;
      if(!pro[i]) ans[g].pb(i),pro[i]=1;  
      if(!pro[i+1]) ans[g].pb(i+1),pro[i+1]=1;
      if(!pro[i+2]) ans[g].pb(i+2),pro[i+2]=1;

     }

    }
    else {

      if(isOnLine(i-1,i,i+1)) {

        if(!pro[i-1]) ans[g].pb(i-1),pro[i-1]=1;  
        if(!pro[i]) ans[g].pb(i),pro[i]=1;
        if(!pro[i+1]) ans[g].pb(i+1),pro[i+1]=1;

      }
      else {
        g=!g;

        pro[i]=1;
        if(!pro[i-1]) ans[g].pb(i-1),pro[i-1]=1;  
        if(!pro[i]) ans[g].pb(i),pro[i]=1;
        if(!pro[i+1]) ans[g].pb(i+1),pro[i+1]=1;
      }

    }

  }

  Answer(ans[0][0],ans[0][1],ans[1][0],ans[1][1]);

}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 632 KB Output is correct - 20 queries, 4 points
2 Correct 2 ms 632 KB Output is correct - 10 queries, 4 points
3 Correct 2 ms 760 KB Output is correct - 156 queries, 4 points
4 Correct 4 ms 760 KB Output is correct - 200 queries, 4 points
5 Correct 2 ms 760 KB Output is correct - 251 queries, 4 points
6 Correct 2 ms 760 KB Output is correct - 301 queries, 4 points
7 Correct 2 ms 760 KB Output is correct - 350 queries, 4 points
8 Correct 2 ms 760 KB Output is correct - 400 queries, 4 points
9 Correct 2 ms 772 KB Output is correct - 450 queries, 4 points
10 Correct 2 ms 776 KB Output is correct - 500 queries, 4 points
11 Correct 2 ms 780 KB Output is correct - 1001 queries, 4 points
12 Correct 2 ms 832 KB Output is correct - 1001 queries, 4 points
13 Correct 2 ms 960 KB Output is correct - 1502 queries, 4 points
14 Correct 2 ms 960 KB Output is correct - 2002 queries, 4 points
15 Correct 2 ms 960 KB Output is correct - 2503 queries, 4 points
16 Correct 2 ms 960 KB Output is correct - 803 queries, 4 points
17 Correct 2 ms 960 KB Output is correct - 854 queries, 4 points
18 Correct 2 ms 1032 KB Output is correct - 900 queries, 4 points
19 Correct 3 ms 1296 KB Output is correct - 12705 queries, 4 points
20 Correct 3 ms 1312 KB Output is correct - 15000 queries, 4 points
21 Correct 4 ms 1588 KB Output is correct - 20060 queries, 4 points
22 Correct 4 ms 1828 KB Output is correct - 28061 queries, 4 points
23 Correct 4 ms 2100 KB Output is correct - 33888 queries, 4 points
24 Correct 5 ms 2100 KB Output is correct - 40944 queries, 4 points
25 Correct 5 ms 2236 KB Output is correct - 49999 queries, 4 points