oj.uz

Submission #304390

# Submission time Handle Problem Language Result Execution time Memory
304390 2020-09-21T08:49:49 Z vivaan_gupta Cave (IOI13_cave) C++14
12 / 100
 24 ms 384 KB 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#include "cave.h"
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
// #define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;

 
const ll INF = 1e12;
// const ll N =(1e5+5); // TODO : change value as per problem
const ll MOD = 1e9+7;
/*int tryCombination(int a[]){
	return 0;
}*/
void exploreCave(int N){
	int n = N;
	int a[n];
	for(int i = 0;i<n;i++){
		a[i] = 0;
		int cave = tryCombination(a);
		if(cave == i) a[i] = 1;
		else a[i] = 0; 
	}
	int s[n];
	for(int i =0;i<n;i++) s[i] = i;
	answer(a,s);
}

/*
void solve(){
		
}
signed main(){
 
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
     // freopen(".in","r",stdin);freopen(".out","w",stdout);
    
     ll tt=1;   
     // cin >> tt;
    while(tt--){    
        solve();
    }    
}*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 384 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
3 Correct 15 ms 384 KB Output is correct
4 Correct 11 ms 384 KB Output is correct
5 Correct 23 ms 384 KB Output is correct
6 Correct 15 ms 384 KB Output is correct
7 Correct 23 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 15 ms 384 KB Output is correct
13 Correct 15 ms 384 KB Output is correct
14 Correct 17 ms 384 KB Output is correct

Subtask #2
0 / 13.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 384 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
3 Correct 15 ms 384 KB Output is correct
4 Correct 11 ms 384 KB Output is correct
5 Correct 23 ms 384 KB Output is correct
6 Correct 15 ms 384 KB Output is correct
7 Correct 23 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 15 ms 384 KB Output is correct
13 Correct 15 ms 384 KB Output is correct
14 Correct 17 ms 384 KB Output is correct
15 Correct 24 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Incorrect 2 ms 384 KB Answer is wrong
18 Halted 0 ms 0 KB -