Submission #985424

#	Time	Username	Problem	Language	Result	Execution time	Memory
985424		SzymonKrzywda	Cave (IOI13_cave)	C++17	100 / 100	260 ms	600 KiB

cave

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

int tryCombination(int S[]);

void answer(int S[],int D[]);

void exploreCave(int N){
    int D[N],S[N],w=0,w_2=0;
    
    if(N==1) {  
        D[0] = 0; S[0] = 1;
        if(tryCombination(S)==0) S[0] = 0;
        answer(S, D);
    }
    
    
    for (int i=0; i<N; i++) D[i] = -1;
    bool good[N];
    //int S_2[N];
    // 0 0 0 0 0
    // 1 1 1 1 1
    // 1 1 1 1 0

    //1110
    //3102
    
    //for (int i=0; i<N; i++) cout <<"dd";
    for (int akt=0; akt<N; akt++){
        for (int i=0; i<N; i++) if(D[i] == -1) S[i] = 0;
        w = tryCombination(S);
        //cout << i << "  "<<  w << endl;
        //if(w==-1) break;
        //if (w > i) continue;
        
        int l = 0,r=N-1,mid,key=1;
        while (l<r){
            if (!(w == -1 || w > akt)){
                for (int i=l; i<=r; i++){
                    if (D[i] == -1) S[i] = (S[i]+1)%2;
                }
                //w = tryCombination(S);
            }   
            mid = (l+r)/2;
            for (int i=l; i<=mid; i++) if (D[i] == -1) S[i] = (S[i]+1)%2;
            w = tryCombination(S);
            if (w == akt){
                r = mid;
                key = (S[l]+1)%2;
            }
            else{
                l = mid+1;
                key = S[l];
            }
            
        }
        D[l] = akt;
        S[l] = key;
        //cout << S[l];
        
        
        
        
        /*
        for (int j=0; j<N; j++){
            S[j] = (S[j]+1)%2;
            w_2 = tryCombination(S);
            if (w_2 == i){
                D[j] = i;
                S[j] = (S[j]+1)%2;
                break;
            }
            S[j] = (S[j]+1%2);
            
        }*/
    }
    /*
    for (int i=0; i<N; i++){
            S[i] = (S[i]+1)%2;
            D[i] = tryCombination(S);
            S[i] = (S[i]+1)%2;*/
        
    answer(S,D);
    
    
    /*
    int S_1[N];
    int S_2[N];
    for (int i=0; i<N; i++) S_2[i] = 1;
    bool good[N];
    int do_zmiany[N];
    for (int i=0; i<N; i++) do_zmiany[i] = -1;
    int w = 0,akt=0,w_2=0,ktory=0;
    while (w != -1){
        if (akt == 0){
            w = tryCombination(S_1);
            if (w == -1){
                ktory = 0;
                break;
            }
            for (int i=0; i<N; i++){
                if (!good[i]){
                    S_1[i] = 1;
                    w_2 = tryCombination(S_1);
                    if (w_2 == -1){
                        w = -1;
                        ktory = 0;
                        break;
                    }
                    if (w_2 < w){
                        S_2[i] = 0;
                        S_1[i] = 0;
                        good[i] = true;
                        D[i] = w_2;
                        w = tryCombination(S_1);

                    }
                    else if(w_2 > w){
                        good[i] = true;
                        D[i] = w;
                        w = w_2;
                    }
                    else S_1[i] = 0;
                }
            }
        }
        else{
            w = tryCombination(S_2);
            if (w == -1){
                ktory = 1;
                break;
            }
            for (int i=0; i<N; i++){
                if (!good[i]){
                    S_2[i] = 0;
                    w_2 = tryCombination(S_2);
                    if (w_2 == -1){
                        w = -1;
                        ktory = 1;
                        break;
                    }
                    if (w_2 < w){
                        S_2[i] = 1;
                        S_1[i] = 1;
                        good[i] = true;
                        D[i] = w_2;
                        w = tryCombination(S_2);
 
                    }
                    else if(w_2 > w){
                        good[i] = true;
                        D[i] = w;
                        w = w_2;
                    }
                    else S_2[i] = 1;
                }
            }
        }
        akt = (akt+1)%2;
        //cout << good[0] << endl;
        //cout << w << endl;
        //cout << "GOOD: ";
        //for (int i=0; i<N; i++) cout << good[i] << " ";
        //cout << endl;
    }
    if (ktory == 0){
        for (int i=0; i<N; i++){
            S_1[i] = (S_1[i]+1)%2;
            if (!good[i]){
                D[i] = tryCombination(S_1);
            }
            S_1[i] = (S_1[i]+1)%2;
        }
        answer(S_1,D);
    }
    else{
        for (int i=0; i<N; i++){
            S_2[i] = (S_2[i]+1)%2;
            if (!good[i]){
                D[i] = tryCombination(S_2);
            }
            S_2[i] = (S_2[i]+1)%2;
        }
        answer(S_2,D);
    }
    */
}

Compilation message (stderr)

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:10:23: warning: unused variable 'w_2' [-Wunused-variable]
   10 |     int D[N],S[N],w=0,w_2=0;
      |                       ^~~
cave.cpp:20:10: warning: unused variable 'good' [-Wunused-variable]
   20 |     bool good[N];
      |          ^~~~

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