답안 #32957

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
32957 2017-10-17T19:00:29 Z imaxblue 고속도로 설계 (CEOI12_highway) C++14
100 / 100
3 ms 4536 KB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() (rand() >> 3)*rand()

int GetN();
int isOnLine(int x, int y, int z);
void Answer(int a1, int b1, int a2, int b2);


int n;
pii a, b, c;
vector<pii> v, w;
int main(){
    n=GetN();
    fox1(l, n) v.pb(mp(l, -1));
    while(1){
        if (v.size()==2){
            a=v.back(); v.pop_back();
            b=v.back(); v.pop_back();
            Answer(a.x, a.y, b.x, b.y);
        }
        w.clear();
        while(v.size()>=3){
            a=v.back(); v.pop_back();
            b=v.back(); v.pop_back();
            c=v.back(); v.pop_back();
            if (!isOnLine(a.x, b.x, c.x)){
                if (isOnLine(a.x, a.y, b.x)){
                    Answer(a.x, a.y, c.x, c.y);
                    return 0;
                } else {
                    Answer(a.x, a.y, b.x, b.y);
                    return 0;
                }
            }
            w.pb(mp(a.x, b.x));
        }
        fox(l, v.size()) w.pb(v[l]);
        v=w;
    }
    return 0;
}

Compilation message

highway.cpp: In function 'int main()':
highway.cpp:18:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define fox(k, x) for (int k=0; k<x; ++k)
                                  ^
highway.cpp:60:9: note: in expansion of macro 'fox'
         fox(l, v.size()) w.pb(v[l]);
         ^
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:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &_N);
                     ^
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2408 KB Output is correct - 19 queries, 4 points
2 Correct 0 ms 2408 KB Output is correct - 9 queries, 4 points
3 Correct 0 ms 2408 KB Output is correct - 155 queries, 4 points
4 Correct 0 ms 2408 KB Output is correct - 201 queries, 4 points
5 Correct 0 ms 2408 KB Output is correct - 250 queries, 4 points
6 Correct 0 ms 2408 KB Output is correct - 302 queries, 4 points
7 Correct 0 ms 2408 KB Output is correct - 349 queries, 4 points
8 Correct 0 ms 2408 KB Output is correct - 399 queries, 4 points
9 Correct 0 ms 2408 KB Output is correct - 449 queries, 4 points
10 Correct 0 ms 2408 KB Output is correct - 501 queries, 4 points
11 Correct 0 ms 2408 KB Output is correct - 1000 queries, 4 points
12 Correct 0 ms 2408 KB Output is correct - 1002 queries, 4 points
13 Correct 0 ms 2548 KB Output is correct - 1501 queries, 4 points
14 Correct 0 ms 2548 KB Output is correct - 2003 queries, 4 points
15 Correct 0 ms 2548 KB Output is correct - 2502 queries, 4 points
16 Correct 0 ms 2408 KB Output is correct - 804 queries, 4 points
17 Correct 0 ms 2408 KB Output is correct - 853 queries, 4 points
18 Correct 0 ms 2408 KB Output is correct - 899 queries, 4 points
19 Correct 0 ms 3000 KB Output is correct - 12706 queries, 4 points
20 Correct 0 ms 3000 KB Output is correct - 14999 queries, 4 points
21 Correct 0 ms 3260 KB Output is correct - 20061 queries, 4 points
22 Correct 3 ms 3512 KB Output is correct - 28062 queries, 4 points
23 Correct 3 ms 4028 KB Output is correct - 33889 queries, 4 points
24 Correct 3 ms 4028 KB Output is correct - 40943 queries, 4 points
25 Correct 3 ms 4536 KB Output is correct - 49998 queries, 4 points