oj.uz

Submission #944601

# Submission time Handle Problem Language Result Execution time Memory
944601 2024-03-13T01:37:29 Z irmuun Cave (IOI13_cave) C++17
0 / 100
 149 ms 556 KB 
#include<bits/stdc++.h>
#include "cave.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

void exploreCave(int n){
    int s[n],d[n];
    vector<bool>used(n,0);
    for(int i=0;i<n;i++){
        vector<int>v;
        for(int j=0;j<n;j++){
            if(!used[j]){
                v.pb(j);
            }
        }
        int sz=v.size(),l=1,r=v.size();
        for(int j=i;j<n;j++){
            s[j]=0;
        }
        int x=tryCombination(s);
        int q=1,p=0;
        if(x==-1||x>i){
            swap(q,p);
        }
        while(l<r){
            int mid=(l+r)/2;
            for(int j=0;j<sz;j++){
                if(j<mid){
                    s[v[j]]=q;
                }
                else{
                    s[v[j]]=p;
                }
            }
            int x=tryCombination(s);
            if(x==-1||x>i){
                r=mid;
            }
            else{
                l=mid+1;
            }
        }
        d[v[l-1]]=i;
        s[i-1]=q;
        used[l-1]=true;
    }
    answer(s,d);
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

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