제출 #993139

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
993139		Rifal	동굴 (IOI13_cave)	C++14	0 / 100	1511 ms	600 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
    int now[N] = {};
    int S[N];
    for(int i = 0; i < N; i++) S[i] = -1;
    int D[N] = {};
    int x = tryCombination(now);
    int cnt = 1;
    for(int i = 0; i < N; i++) {
        int l = 0, r = N-1;
        for(int j = 0; j < N; j++) {
            if(S[j] == -1) now[j] = -1;
            else now[j] = S[j];
        }
      //  cout << x << ' ' << i  << 'a' << endl;
        if(i == x) {
            while(l < r) {
            int mid = (l+r)/2;
            vector<int> v;
            for(int j = 0; j <= N; j++) {
                if(now[j] == -1 && j >= l && j <= mid) {
                    v.push_back(j);
                    now[j] = 1;
                }
                else if(now[j] == -1) {
                    v.push_back(j);
                    now[j] = 0;
                }
            }
            cnt++;
       //     for(int j = 0; j < N; j++) cout << now[j] << ' ';
            int y = tryCombination(now);
        //    cout << y << 'o' << endl;
            x = tryCombination(now);
         //   cout << endl;
          //   cout << l << ' ' << mid << ' ' << r << ' ' << x << 'b' << endl;
            if(x == i) {
                l = mid+1;
            }
            else {
                r = mid;
            }
            for(int j = 0; j < v.size(); j++) {
                now[v[j]] = -1;
            }
        }   
        S[l] = 0;
        D[i] = l;
        }
        else {
        while(l < r) {
            int mid = (l+r)/2;
            vector<int> v;
            for(int j = 0; j <= N; j++) {
                if(now[j] == -1 && j >= l && j <= mid) {
                    v.push_back(j);
                    now[j] = 1;
                }
                else if(now[j] == -1) {
                    v.push_back(j);
                    now[j] = 0;
                }
            }
            cnt++;
            x = tryCombination(now);
           //  cout << l << ' ' << mid << ' ' << r << ' ' << x << 'c' << endl;
            if(x != i) {
                l = mid+1;
            }
            else {
                r = mid;
            }
            for(int j = 0; j < v.size(); j++) {
                now[v[j]] = -1;
            }
        }
        S[l] = 1;
        D[i] = l;
        }  
    }
    answer(S,D);
}

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:45:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |             for(int j = 0; j < v.size(); j++) {
      |                            ~~^~~~~~~~~~
cave.cpp:34:17: warning: unused variable 'y' [-Wunused-variable]
   34 |             int y = tryCombination(now);
      |                 ^
cave.cpp:75:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |             for(int j = 0; j < v.size(); j++) {
      |                            ~~^~~~~~~~~~

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