제출 #832649

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
832649		matthewhutama	동굴 (IOI13_cave)	C++14	100 / 100	628 ms	568 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
ll vis[5005];
void exploreCave(int N) {
    ll ans[5005], koneksi[5005];
    for (int i = 0; i < N; i++){
        ll ask[5005];
        for (int j = 0; j < N; j++){
            if (vis[j] == 0){
                ask[j] = 0;
            }
            else{
                ask[j] = ans[j];
            }
        }
        // for (int p = 0;p<N;p++) cout<<ask[p];
        ll t = tryCombination(ask);
        // cout << i <<" "<< t<<endl;
        if (t == i){
            ll lo = 0, hi = N - 1, mid, simpan;
            while (lo <= hi){
                mid = (lo + hi) / 2;
                for (int k = 0; k <= mid; k++){
                    if (vis[k] == 0){
                        ask[k] = 1;
                    }
                    else{
                        ask[k] = ans[k];
                    }
                }
                for (int k = mid + 1; k < N; k++){
                    if (vis[k] == 0){
                        ask[k] = 0;
                    }
                    else{
                        ask[k] = ans[k];
                    }
                }
                // for (int p = 0;p<N;p++) cout<<ask[p];
                // cout<<endl;
                ll u = tryCombination(ask);
                // cout<<u<<endl<<"________"<<endl;
                if (u == i){
                    lo = mid + 1;
                }
                else{
                    hi = mid - 1;
                    simpan = mid;
                }
            }
            koneksi[simpan] = i;
            ans[simpan] = 1;
            vis[simpan] = 1;
        }
        else{
            ll lo = 0, hi = N - 1, mid, simpan;
            while (lo <= hi){
                mid = (lo + hi) / 2;
                for (int j = 0; j <= mid; j++){
                    if (vis[j] == 0){
                        ask[j] = 1;
                    }
                    else{
                        ask[j] = ans[j];
                    }
                }
                for (int j = mid + 1; j < N; j++){
                    if (vis[j] == 0){
                        ask[j] = 0;
                    }
                    else{
                        ask[j] = ans[j];
                    }
                }
                ll u = tryCombination(ask);
                if (u == i){
                    hi = mid - 1;
                    simpan = mid;
                }
                else{
                    lo = mid + 1;
                }
            }
            koneksi[simpan] = i;
            ans[simpan] = 0;
            vis[simpan] = 1;
        }
    }
    answer (ans, koneksi);
}

// #include "graderlib.c"

// int main() {
//     int N;
// 	N = init();
// 	exploreCave(N);
//     printf("INCORRECT\nYour solution did not call answer().\n");
// 	return 0;
// }

컴파일 시 표준 에러 (stderr) 메시지

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:88:25: warning: 'simpan' may be used uninitialized in this function [-Wmaybe-uninitialized]
   88 |             vis[simpan] = 1;
      |             ~~~~~~~~~~~~^~~
cave.cpp:55:25: warning: 'simpan' may be used uninitialized in this function [-Wmaybe-uninitialized]
   55 |             vis[simpan] = 1;
      |             ~~~~~~~~~~~~^~~

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