oj.uz

답안 #833890

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
833890 2023-08-22T09:22:32 Z maomao90 카멜레온의 사랑 (JOI20_chameleon) C++17
24 / 100
 47 ms 2324 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
#include "chameleon.h"
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 1005;

namespace {
    int n;
    int occ[MAXN][MAXN];
}

void Solve(int N) {
    n = N;
    //vi lid(n), rid(n);
    //iota(ALL(lid), 1);
    //iota(ALL(rid), n + 1);
    vi lid, rid;
    REP (i, 1, 2 * n + 1) {
        lid.pb(i);
        if (Query(lid) != SZ(lid)) {
            lid.pop_back();
            rid.pb(i);
        }
    }
    assert(SZ(lid) <= n);
    REP (z, 0, 2) {
        for (int i : rid) {
            vi p(ALL(lid));
            p.pb(i);
            int s = Query(p) - SZ(p);
            /*
            if (s == -1) {
                int lo = 0, hi = n - 1;
                while (lo < hi) {
                    int mid = lo + hi >> 1;
                    vi p(lid.begin(), lid.begin() + mid + 1);
                    p.pb(i);
                    int x = Query(p) - SZ(p);
                    if (x <= s) {
                        hi = mid;
                    } else {
                        lo = mid + 1;
                    }
                }
                cerr << "ANSWER: " << i << ' ' << lid[hi] << '\n';
                Answer(i, lid[hi]);
                continue;
            }
            */
            int lo = 0, hi = n - 1;
            while (lo < hi) {
                int mid = lo + hi >> 1;
                vi p(lid.begin(), lid.begin() + mid + 1);
                p.pb(i);
                int x = Query(p) - SZ(p);
                if (x <= s) {
                    hi = mid;
                } else {
                    lo = mid + 1;
                }
            }
            cerr << i << ' ' << lid[hi] << '\n';
            occ[min(i, lid[hi])][max(i, lid[hi])]++;
            lo = 0, hi = n - 1;
            while (lo < hi) {
                int mid = lo + hi + 1 >> 1;
                vi p(lid.begin() + mid, lid.end());
                p.pb(i);
                int x = Query(p) - SZ(p);
                if (x <= s) {
                    lo = mid;
                } else {
                    hi = mid - 1;
                }
            }
            cerr << i << ' ' << lid[lo] << '\n';
            occ[min(i, lid[lo])][max(i, lid[lo])]++;
        }
        swap(lid, rid);
    }
    REP (i, 1, 2 * n + 1) {
        REP (j, i + 1, 2 * n + 1) {
            if (occ[i][j] >= 2) {
                cerr << "ANSWER: " << i << ' ' << j << '\n';
                Answer(i, j);
            }
        }
    }
}

Compilation message

chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:86:30: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   86 |                 int mid = lo + hi >> 1;
      |                           ~~~^~~~
chameleon.cpp:100:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  100 |                 int mid = lo + hi + 1 >> 1;
      |                           ~~~~~~~~^~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 39 ms 2160 KB Output is correct
4 Correct 39 ms 2176 KB Output is correct
5 Correct 43 ms 2172 KB Output is correct
6 Correct 39 ms 2088 KB Output is correct
7 Correct 40 ms 2192 KB Output is correct
8 Correct 43 ms 2248 KB Output is correct
9 Correct 39 ms 2180 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Incorrect 0 ms 336 KB Wrong Answer [6]
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Incorrect 0 ms 336 KB Wrong Answer [6]
5 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 41 ms 2276 KB Output is correct
4 Correct 43 ms 2296 KB Output is correct
5 Correct 42 ms 2324 KB Output is correct
6 Correct 42 ms 2284 KB Output is correct
7 Correct 41 ms 2244 KB Output is correct
8 Correct 47 ms 2312 KB Output is correct
9 Correct 41 ms 2308 KB Output is correct

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 39 ms 2160 KB Output is correct
4 Correct 39 ms 2176 KB Output is correct
5 Correct 43 ms 2172 KB Output is correct
6 Correct 39 ms 2088 KB Output is correct
7 Correct 40 ms 2192 KB Output is correct
8 Correct 43 ms 2248 KB Output is correct
9 Correct 39 ms 2180 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Incorrect 0 ms 336 KB Wrong Answer [6]
14 Halted 0 ms 0 KB -