oj.uz

Submission #7523

# Submission time Handle Problem Language Result Execution time Memory
7523 2014-08-10T12:09:56 Z baneling100 Cave (IOI13_cave) C++
0 / 100
 7 ms 640 KB 
#include "cave.h"
#include <vector>
#include <stdio.h>

using namespace std;

vector <int> A;
int S[5000], D[5000], Check[5000];

void exploreCave(int N)
{
    int i, j, Left, Mid, Right, Value, Temp;

    for(i=0 ; i<N ; i++)
    {
        A.clear();
        for(j=0 ; j<N ; j++)
            if(!Check[j])
                A.push_back(j);
        Left=0;
        Right=A.size()-1;
        Value=tryCombination(S);
        while(Left<Right)
        {
            Mid=(Left+Right)/2;
            for(i=Left ; i<=Mid ; i++)
                S[A[i]]=1-S[A[i]];
            Temp=tryCombination(S);
            for(i=Left ; i<=Mid ; i++)
                S[A[i]]=1-S[A[i]];
            if(Value==i)
            {
                if(Temp>i || Temp==-1)
                    Right=Mid-1;
                else
                    Left=Mid+1;
            }
            else
            {
                if(Temp==i)
                    Right=Mid-1;
                else
                    Left=Mid+1;
            }
        }
        if(Value==i)
            S[A[Left]]=1-S[A[Left]];
        D[A[Left]]=i;
    }
    answer(S,D);
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

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