Submission #1237187

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237187		SG2Alok	Cave (IOI13_cave)	C++20	13 / 100	242 ms	496 KiB

cave

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

void exploreCave(int N) {
    int a[N], ans[N];
    for(int i = 0; i < N; i++) a[i] = 0, ans[i] = -1;
    
    int cur = tryCombination(a); 
    bool ada = true;
    while(cur != -1 && ada){ 
      ada = false;
    	for(int i = 0; i < N; i++){
    	  if(ans[i] != -1) continue; 
    	  ada = true;
    		a[i] = 1 - a[i];
    		int judges = tryCombination(a);
    		if(judges == -1) break;
    		if(judges < cur){
    			a[i] = 1 - a[i];
    			ans[i] = judges;
			} else if(judges > cur){
				ans[i] = cur;
				cur = judges;
			}
		}
	}
    
    for(int i = 0; i < N; i++){
      if(ans[i] != -1) continue;
    	a[i] = 1 - a[i];
		ans[i] = tryCombination(a);
    	a[i] = 1 - a[i];
	}
	
	answer(a, ans);
}

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