oj.uz

답안 #313907

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
313907 2020-10-17T09:17:56 Z Fidisk 콤보 (IOI18_combo) C++14
5 / 100
 1 ms 256 KB 
#include <bits/stdc++.h>
#include <combo.h>
using namespace std;
 
#define oo 1e18
#define fi first
#define se second
#define sp(iiii) setprecision(iiii)
#define IO ios_base::sync_with_stdio(false); cin.tie(0)
#define ms(aaaa,xxxx) memset(aaaa,xxxx,sizeof(aaaa))
#define cntbit(xxxx) __builtin_popcount(xxxx)
#define getbit(xxxx,aaaa) ((xxxx>>(aaaa-1))&1)
 
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int> piii;
typedef pair<long long,long long> pll;
typedef pair<pair<long long,long long>,long long> plll;
 
const ll mod=1e9+7;
 
char st,s1,s2,s3;
string ans;
int i,k;
 
string guess_sequence(int n) {
    if (press("AB")>0) {
        if (press("A")>0) {
            st='A';
        }
        else {
            st='B';
        }
    }
    else {
        if (press("X")>0) {
            st='X';
        }
        else {
            st='Y';
        }
    }
    if (st=='A') {
        s1='B';
        s2='X';
        s3='Y';
    }
    else if (st=='B') {
        s1='A';
        s2='X';
        s3='Y';
    }
    else if (st=='X') {
        s1='B';
        s2='A';
        s3='Y';
    }
    else if (st=='Y') {
        s1='B';
        s2='X';
        s3='A';
    }
    for (i=1;i<n-1;i++) {
        k=press(st+ans+s1+st+ans+s2+s1+st+ans+s2+s2+st+ans+s2+s3);
        if (k==(i+1)) {
            ans+=s1;
        }
        else if (k==(i+2)) {
            ans+=s2;
        }
        else {
            ans+=s3;
        }
    }
    if (press(st+ans+'A'+st+ans+'B')==n) {
        if (press(st+ans+'A')==n) {
            ans+='A';
        }
        else {
            ans+='B';
        }
    }
    else {
        if (press(st+ans+'X')==n) {
            ans+='X';
        }
        else {
            ans+='Y';
        }
    }
    return st+ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 0 ms 200 KB Output is correct
11 Correct 0 ms 200 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 0 ms 200 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 1 ms 200 KB Output is correct
20 Correct 1 ms 200 KB Output is correct
21 Correct 1 ms 200 KB Output is correct
22 Correct 0 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 0 ms 200 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 0 ms 200 KB Output is correct
29 Correct 1 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 1 ms 200 KB Output is correct
34 Correct 1 ms 200 KB Output is correct
35 Correct 1 ms 200 KB Output is correct
36 Correct 1 ms 200 KB Output is correct

Subtask #2
0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 200 KB Wrong Answer: wrong guess.
2 Halted 0 ms 0 KB -