oj.uz

답안 #949638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949638 2024-03-19T13:41:27 Z GrindMachine 고속도로 설계 (CEOI12_highway) C++17
100 / 100
 1 ms 1500 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "office.h"

int f(int x, int y, int z){
    return isOnLine(x,y,z);
}

void solve(int test_case)
{
    int n = GetN();
    int res1 = f(1,2,3);
    vector<int> a,b;
    rep1(i,n) b.pb(i);

    if(!res1){
    	int res2 = f(4,5,6);
    	if(!res2){
    		// brute force
            vector<int> c;
            bool g[7][7][7];
            memset(g,0,sizeof g);
            rep1(i,6){
                for(int j = i+1; j <= 6; ++j){
                    for(int k = j+1; k <= 6; ++k){
                        g[i][j][k] = f(i,j,k);
                        if(c.empty() and g[i][j][k]){
                            c = {i,j,k};
                        }
                    }
                }
            }

            rep1(i,6){
                if(count(all(c),i)) conts;
                vector<int> ord = {c[0],c[1],i};
                sort(all(ord));

                if(g[ord[0]][ord[1]][ord[2]]){
                    c.pb(i);
                }
            }

            vector<int> d;
            rep1(i,6) d.pb(i);

            trav(x,c){
                d.erase(find(all(d),x));
            }

            assert(sz(d) >= 2);
    
            Answer(c[0],c[1],d[0],d[1]);            
    		return;
    	}

    	for(int i = 4; i <= 6; ++i){
    		b.erase(find(all(b),i));
    		a.pb(i);
    	}
    }
    else{
    	for(int i = 1; i <= 3; ++i){
    		b.erase(find(all(b),i));
    		a.pb(i);
    	}
    }

    vector<int> c;
    // trav(x,b) cout << x << " ";
    // cout << endl;

    while(true){
    	int x = b[sz(b)-1], y = b[sz(b)-2];
    	if(f(a[0],x,y)){
            b.pop_back();
            b.pop_back();
            conts;
        }

    	if(f(a[0],a[1],x)){
    		c.pb(y);
    		b.pop_back(), b.pop_back();
    	}
    	else{
    		c.pb(x);
    		b.pop_back();
    	}

    	if(sz(c) >= 2){
    		Answer(a[0],a[1],c[0],c[1]);
            return;
    	}
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    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);
      |     ~~~~~^~~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct - 22 queries, 4 points
2 Correct 1 ms 344 KB Output is correct - 12 queries, 4 points
3 Correct 0 ms 344 KB Output is correct - 158 queries, 4 points
4 Correct 0 ms 344 KB Output is correct - 202 queries, 4 points
5 Correct 0 ms 344 KB Output is correct - 253 queries, 4 points
6 Correct 0 ms 344 KB Output is correct - 303 queries, 4 points
7 Correct 0 ms 344 KB Output is correct - 352 queries, 4 points
8 Correct 0 ms 344 KB Output is correct - 402 queries, 4 points
9 Correct 0 ms 344 KB Output is correct - 452 queries, 4 points
10 Correct 0 ms 344 KB Output is correct - 502 queries, 4 points
11 Correct 0 ms 344 KB Output is correct - 1003 queries, 4 points
12 Correct 0 ms 344 KB Output is correct - 1003 queries, 4 points
13 Correct 0 ms 344 KB Output is correct - 1504 queries, 4 points
14 Correct 0 ms 344 KB Output is correct - 2004 queries, 4 points
15 Correct 1 ms 344 KB Output is correct - 2505 queries, 4 points
16 Correct 1 ms 344 KB Output is correct - 805 queries, 4 points
17 Correct 0 ms 344 KB Output is correct - 856 queries, 4 points
18 Correct 1 ms 344 KB Output is correct - 902 queries, 4 points
19 Correct 1 ms 600 KB Output is correct - 12707 queries, 4 points
20 Correct 1 ms 600 KB Output is correct - 15002 queries, 4 points
21 Correct 1 ms 856 KB Output is correct - 20062 queries, 4 points
22 Correct 1 ms 988 KB Output is correct - 28063 queries, 4 points
23 Correct 1 ms 1244 KB Output is correct - 33890 queries, 4 points
24 Correct 1 ms 1244 KB Output is correct - 40946 queries, 4 points
25 Correct 1 ms 1500 KB Output is correct - 50001 queries, 4 points