oj.uz

Submission #290014

# Submission time Handle Problem Language Result Execution time Memory
290014 2020-09-03T09:51:26 Z khangal Cave (IOI13_cave) C++14
25 / 100
 87 ms 29560 KB 
#include<bits/stdc++.h>

#include "cave.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
typedef tree<ll , null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_multi_set;
typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b,c[1234567],d[1<<20],k,i,j,l,r,h,a,w,x,y,z,t;
bool used[1234567];
pair<int,int> p[1234567];
vector<int> v[1234567],vec,vv1,vv2;
// string s1,s;
// int sz[1234567],par[1234567];
int tr[5234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
map<ll,ll> mp;
void exploreCave(int N){
    n=N;
    int s[n],d[n];
    for(int i=0;i<n;i++){
        s[i]=0;
        d[i]=i;
    }
    int cnt=0;
    while(true){
        if(cnt>10000)break;
        ll res = tryCombination(s);
        if(res==-1){
            if(sum!=0)
            answer(s,d);
        }
        else{
            s[res]=1;
            sum++;
        }
        cnt++;
    }
    for(int i=0;i<n;i++)s[i]=0,d[i]=0;
    for(int i=0;i<n;i++){
        s[i]=1;
        int res = tryCombination(s);
        d[i]=res;
        s[i]=0;
    }
    answer(s,d);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 29440 KB Output is correct
2 Correct 27 ms 29440 KB Output is correct
3 Correct 31 ms 29440 KB Output is correct
4 Correct 28 ms 29440 KB Output is correct
5 Correct 70 ms 29440 KB Output is correct
6 Correct 26 ms 29432 KB Output is correct
7 Correct 26 ms 29432 KB Output is correct
8 Correct 20 ms 29304 KB Output is correct
9 Correct 20 ms 29312 KB Output is correct
10 Correct 20 ms 29312 KB Output is correct
11 Correct 20 ms 29312 KB Output is correct
12 Correct 28 ms 29440 KB Output is correct
13 Correct 26 ms 29440 KB Output is correct
14 Correct 26 ms 29440 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 29440 KB Output is correct
2 Correct 20 ms 29312 KB Output is correct
3 Correct 69 ms 29560 KB Output is correct
4 Correct 20 ms 29440 KB Output is correct
5 Correct 20 ms 29312 KB Output is correct
6 Correct 69 ms 29440 KB Output is correct
7 Correct 71 ms 29472 KB Output is correct
8 Correct 87 ms 29440 KB Output is correct
9 Correct 85 ms 29440 KB Output is correct
10 Correct 87 ms 29440 KB Output is correct
11 Correct 68 ms 29468 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 29312 KB Output is correct
2 Correct 20 ms 29312 KB Output is correct
3 Correct 20 ms 29312 KB Output is correct
4 Correct 20 ms 29312 KB Output is correct
5 Incorrect 20 ms 29440 KB Answer is wrong
6 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 29312 KB Output is correct
2 Correct 20 ms 29312 KB Output is correct
3 Correct 20 ms 29312 KB Output is correct
4 Correct 20 ms 29312 KB Output is correct
5 Incorrect 20 ms 29440 KB Answer is wrong
6 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 29440 KB Output is correct
2 Correct 27 ms 29440 KB Output is correct
3 Correct 31 ms 29440 KB Output is correct
4 Correct 28 ms 29440 KB Output is correct
5 Correct 70 ms 29440 KB Output is correct
6 Correct 26 ms 29432 KB Output is correct
7 Correct 26 ms 29432 KB Output is correct
8 Correct 20 ms 29304 KB Output is correct
9 Correct 20 ms 29312 KB Output is correct
10 Correct 20 ms 29312 KB Output is correct
11 Correct 20 ms 29312 KB Output is correct
12 Correct 28 ms 29440 KB Output is correct
13 Correct 26 ms 29440 KB Output is correct
14 Correct 26 ms 29440 KB Output is correct
15 Correct 67 ms 29440 KB Output is correct
16 Correct 20 ms 29312 KB Output is correct
17 Correct 69 ms 29560 KB Output is correct
18 Correct 20 ms 29440 KB Output is correct
19 Correct 20 ms 29312 KB Output is correct
20 Correct 69 ms 29440 KB Output is correct
21 Correct 71 ms 29472 KB Output is correct
22 Correct 87 ms 29440 KB Output is correct
23 Correct 85 ms 29440 KB Output is correct
24 Correct 87 ms 29440 KB Output is correct
25 Correct 68 ms 29468 KB Output is correct
26 Correct 20 ms 29312 KB Output is correct
27 Correct 20 ms 29312 KB Output is correct
28 Correct 20 ms 29312 KB Output is correct
29 Correct 20 ms 29312 KB Output is correct
30 Incorrect 20 ms 29440 KB Answer is wrong
31 Halted 0 ms 0 KB -