oj.uz

Submission #1057169

# Submission time Handle Problem Language Result Execution time Memory
1057169 2024-08-13T14:40:39 Z MrPavlito Cave (IOI13_cave) C++17
0 / 100
 22 ms 348 KB 
#include "cave.h"
#include <bits/stdc++.h>
//#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
//#define endl "\n"
#define pii pair<int,int>

using namespace std;

const int MAXN = 5e3+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;


void exploreCave(int N) {
    int n = N;
    int trenutnacomb[n];
    int solved[n];
    int rez[n];
    bool vis[n];
    for(int i=0; i<n; i++)solved[i] = vis[i] = rez[i] = 0;
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)trenutnacomb[j] = rez[j];
        int t = tryCombination(trenutnacomb);
        int l = 0;
        int r = n-1;
        while(l<r)
        {
            int mid = l+r >> 1;
            for(int j=l; j<= mid; j++)if(!solved[j])trenutnacomb[j] = (trenutnacomb[j]^1);
            int p = tryCombination(trenutnacomb);
            bool pomoc;
            if(p == i && t == i)pomoc = true;
            else if(p != i && t != i)pomoc = true;
            else if(p != i && t == i)pomoc = false;
            else pomoc = false;
            if(pomoc)l = mid+1;
            else r = mid;
            t = p;
        }
        solved[l] = i;
        rez[l] = trenutnacomb[l];
        if(t == i)rez[l] = (trenutnacomb[l]^1);
    }
    answer(rez, solved);

}

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:25:55: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   25 |     for(int i=0; i<n; i++)solved[i] = vis[i] = rez[i] = 0;
      |                                                ~~~~~~~^~~
cave.cpp:34:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |             int mid = l+r >> 1;
      |                       ~^~

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 348 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 348 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 348 KB Answer is wrong
2 Halted 0 ms 0 KB -