제출 #648892

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
648892		JANCARAPAN	동굴 (IOI13_cave)	C++17	0 / 100	523 ms	460 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x);
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr <<__func__<<":"<<" [" << #x << "] = ["; _print(x); /*cerr << "\e[39m" << endl;*/
#else
#define dbg(x...)
#endif


// int tryCombination(int a[4]) {
//     int sm = 0;
//     if (a[2] == 1) {
//         sm++;
//         if (a[1] == 1) {
//             sm++;
//             if (a[3] == 0) {
//                 sm++;
//                 if (a[0] == 1) {
//                     sm++;
//                 }
//             }
//         }
//     }
//     if (sm == 4) return -1;
//     else return sm;
// }


void exploreCave(int n) {
    int pos[n], con[n], used[n];

    for (int i=0; i<n; i++) {
        // per a cada porta faig bs dels interruptors
        int l = 0, r = n - 1;
        int res = n - 1;
        int on = (tryCombination(pos) == i);

        while (l <= r) {
            int m = l + (r - l) / 2;
            bool can = 0;
 
            for (int j=0; j<n; j++) {
                if (used[j]) continue;
                if (j>=l && j<=m) {
                    pos[j] = on;
                } else {
                    pos[j] = 1 - on;
                }
            }

            int ans = tryCombination(pos);
            
            if (ans == i + 1 || ans == -1) {
                can = 1;
            } 

            for (int j=0; j<n; j++) {
                if (used[j]) continue;
                pos[j] = 0;
            }

            if (can) {
                r = m - 1;
                res = m;
            } else {
                l = m + 1;
            }
            //cerr << m << " " << l << " " << r << endl;
        
        }
       //dbg(res, on)
        
        used[res] = 1;
        pos[res] = on;

        con[res] = i;
    }
    answer(pos, con);
    
    // for (auto x : pos) cout << x << " ";
    // cout << endl << endl;
    // for (auto x : con) cout << x <<" ";
    // cout << endl;
}

// int main() {
//     exploreCave(4);
// }

• Subtask 1: 0 / 12
• Subtask 2: 0 / 13
• Subtask 3: 0 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24