oj.uz

답안 #172008

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
172008 2019-12-30T19:04:50 Z kostia244 고속도로 설계 (CEOI12_highway) C++17
96 / 100
 9 ms 5604 KB 
#include"office.h"
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pi = pair<ll, ll>;
using vpi = vector<pi>;
#define iol isOnLine
int n;
vpi bad;
void check(vpi a) {
  // cout << "++\n";
  if(bad.empty()) {
    if(a[0].second<2||a[1].second<2||a[2].second<2) {
    for(auto i : a) bad.pb(i);
    return;
    }
    for(int i = 1; i < 3; i++) {
      if(iol(a[0].first, a[0].first+1, a[i].first)) {
        Answer(a[0].first, a[0].first+1,a[3^i].first, a[3^i].first+1);
        exit(0);
      }
    }
    Answer(a[1].first, a[1].first+1,a[2].first, a[2].first+1);
    exit(0);
  }
  for(int i = 0; i < 3; i++) {
    for(int j = i+1; j < 3; j++) {
      vpi z[2];
      for(int k = 0; k <3; k++)
        z[iol(a[i].first, a[j].first, bad[k].first)].pb(bad[k]);
      if(z[0].size()&&z[1].size()) {
        Answer(a[i].first, a[j].first, a[3^i^j].first, z[0][0].first);
        exit(0);
      }
    }
  }
}
void solve(vpi a) {
  // cout << a.size() << "\n";
  if(a.size()==2) {
    Answer(a[0].first, a[0].first+1,a[1].first, a[1].first+1);
    exit(0);
  }
  if(a.size()==1) {
  // for(int i = 0; i < 3; i++) {
  //   for(int j = 0; j < 3; j++) {
  //     if(iol(bad[i].first, bad[j].first, a[0].first)) {
  //       Answer(bad[i].first, bad[j].first, bad[3^i^j].first, bad[3^i^j].first+1);
  //     }
  //   }
  // }
  for(int i = 0; i < 3; i++) {
    for(int j = 0; j < 3; j++) {
      if(bad[i].second<2||i==j) continue;
      if(iol(bad[i].first, bad[i].first+1, bad[j].first)) {
        Answer(bad[i].first, bad[j].first, bad[3^i^j].first, a[0].first);
      }
    }
  }
  }
  vpi t;
  int x = 0;
  while(x+2 < a.size()) {
    if(iol(a[x].first, a[x+1].first, a[x+2].first)) {
      t.pb({a[x].first, a[x].second+a[x+1].second+a[x+2].second});
    } else {
      check({a[x], a[x+1], a[x+2]});
    }
    x+=3;
  }
  while(x < a.size()) t.pb(a[x++]);
  solve(t);
}
int main() {
  n = GetN();
  vpi a;
  for(int i = 1; i <= n; i++) a.pb({i, 1});
  solve(a);
}

Compilation message

highway.cpp: In function 'void solve(vpi)':
highway.cpp:66:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(x+2 < a.size()) {
         ~~~~^~~~~~~~~~
highway.cpp:74:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(x < a.size()) t.pb(a[x++]);
         ~~^~~~~~~~~~
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
96.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct - 19 queries, 4 points
2 Incorrect 2 ms 376 KB Output isn't correct - Wrong answer
3 Correct 2 ms 376 KB Output is correct - 155 queries, 4 points
4 Correct 2 ms 376 KB Output is correct - 201 queries, 4 points
5 Correct 2 ms 376 KB Output is correct - 250 queries, 4 points
6 Correct 2 ms 380 KB Output is correct - 302 queries, 4 points
7 Correct 2 ms 396 KB Output is correct - 349 queries, 4 points
8 Correct 2 ms 376 KB Output is correct - 399 queries, 4 points
9 Correct 2 ms 376 KB Output is correct - 449 queries, 4 points
10 Correct 2 ms 376 KB Output is correct - 501 queries, 4 points
11 Correct 2 ms 504 KB Output is correct - 1001 queries, 4 points
12 Correct 2 ms 504 KB Output is correct - 1002 queries, 4 points
13 Correct 2 ms 504 KB Output is correct - 1501 queries, 4 points
14 Correct 2 ms 504 KB Output is correct - 2003 queries, 4 points
15 Correct 2 ms 632 KB Output is correct - 2502 queries, 4 points
16 Correct 2 ms 376 KB Output is correct - 804 queries, 4 points
17 Correct 2 ms 376 KB Output is correct - 853 queries, 4 points
18 Correct 2 ms 376 KB Output is correct - 899 queries, 4 points
19 Correct 4 ms 1648 KB Output is correct - 12706 queries, 4 points
20 Correct 4 ms 1900 KB Output is correct - 14999 queries, 4 points
21 Correct 5 ms 2412 KB Output is correct - 20061 queries, 4 points
22 Correct 6 ms 3308 KB Output is correct - 28062 queries, 4 points
23 Correct 7 ms 3812 KB Output is correct - 33889 queries, 4 points
24 Correct 8 ms 4580 KB Output is correct - 40943 queries, 4 points
25 Correct 9 ms 5604 KB Output is correct - 49998 queries, 4 points