oj.uz

답안 #647878

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
647878 2022-10-04T11:15:42 Z ansgar 동굴 (IOI13_cave) C++17
34 / 100
 22 ms 436 KB 
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;

//#define int long long
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define vb vector<bool>
#define vc vector<char>
#define vvc vector<vc>
#define vvb vector<vb>
#define si set<int>
#define mii map<int,int>

const int mod=1e9+7;
const int N=2e5+1;

int fact[N],frev[N],s[N],l[N];
bool P[N];
vi primes;
vvi G;
vb B;

int gcd(int a,int b){
    if(b==0)return a;
    return gcd(b,a%b);
}
int mcm(int a,int b){
    return (a*b)/gcd(a,b);
}
int poW(int a,int p){
    if(p==0)return 1;
    if(p==1)return a;
    return poW(a*a%mod,p/2)*(p%2?a:1)%mod;
}
bool prime(int n){
    if(n<=1)return false;
    for(int i=2;i*i<=n;i++){
        if(n%i==0)return false;
    }
    return true;
}
void initfact(){
    fact[0]=fact[1]=frev[0]=frev[1]=1;
    for(int i=2;i<N;i++){
        fact[i]=i*fact[i-1]%mod;
        frev[i]=poW(fact[i],mod-2);
    }
}
int choose(int n,int k){
    if(n<k)return 0;
    return (fact[n]*frev[k]%mod)*frev[n-k]%mod;
}
void initPrimes(){
    memset(P,true,sizeof(P));
    P[0]=P[1]=false;
    for(int i=2;i<N;i++){
        if(P[i]){
            primes.push_back(i);
            for(int j=i*2;j<N;j+=i){
                P[j]=false;
            }
        }
    }
}
void resetdsu(){
    for(int i=0;i<N;i++){
        s[i]=1;
        l[i]=i;
    }
}
int find(int x){
    while(x!=l[x])x=l[x];
    return x;
}
bool same(int a,int b){
    return find(a)==find(b);
}
void unite(int a,int b){
    a=find(a);
    b=find(b);
    if(s[a]<s[b])swap(a,b);
    l[b]=a;
    s[a]+=s[b];
}
void dfs(int u){
    B[u]=true;
    for(int v : G[u]){
        if(!B[v]){
            dfs(v);
        }
    }
}
int n;
/*int tryCombination(int S[]){
    for(int i=0;i<n;i++)cout<<S[i]<<" ";
    cout<<endl;
    int x;
    cin>>x;
    return x;
}
void answer(int S[],int D[]){
    for(int i=0;i<n;i++){
        cout<<S[i]<<" ";
    }
    cout<<endl;
    for(int i=0;i<n;i++){
        cout<<D[i]<<" ";
    }
    cout<<endl;
}*/
void exploreCave(int n){
    int S[n];
    memset(S,0,sizeof(S));
    int D[n];
    int val=tryCombination(S);
    for(int p=0;p<n;p++){
        for(int i=0;i<n;i++){
            S[i]^=1;
            int aux=tryCombination(S);
            if(aux==-1){
                val=-1;
                break;
            }
            if(aux<=val)S[i]^=1;
            else val=aux;
        }
        if(val==-1)break;
    }
    for(int i=0;i<n;i++){
        S[i]^=1;
        val=tryCombination(S);
        D[i]=val;
        S[i]^=1;
    }
    answer(S,D);
}
/*signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n;
    exploreCave(n);
}*/

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 340 KB Output is correct
2 Correct 11 ms 416 KB Output is correct
3 Correct 16 ms 432 KB Output is correct
4 Correct 9 ms 424 KB Output is correct
5 Correct 10 ms 340 KB Output is correct
6 Correct 16 ms 436 KB Output is correct
7 Correct 18 ms 340 KB Output is correct
8 Incorrect 1 ms 212 KB Answer is wrong
9 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 432 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 9 ms 436 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 16 ms 436 KB Output is correct
7 Correct 18 ms 432 KB Output is correct
8 Correct 17 ms 436 KB Output is correct
9 Correct 12 ms 436 KB Output is correct
10 Correct 22 ms 436 KB Output is correct
11 Correct 17 ms 340 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 224 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 224 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Incorrect 2 ms 340 KB too much calls on tryCombination()
21 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 340 KB Output is correct
2 Correct 11 ms 416 KB Output is correct
3 Correct 16 ms 432 KB Output is correct
4 Correct 9 ms 424 KB Output is correct
5 Correct 10 ms 340 KB Output is correct
6 Correct 16 ms 436 KB Output is correct
7 Correct 18 ms 340 KB Output is correct
8 Incorrect 1 ms 212 KB Answer is wrong
9 Halted 0 ms 0 KB -