oj.uz

답안 #305151

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305151 2020-09-22T16:02:29 Z bigDuck Password (RMI18_password) C++14
0 / 100
 67 ms 504 KB 
#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
//#define int ll

int t, n, m, k, a[300010], q, l, r;

int cnt[300];



int query(string str);


string guess(int n, int s){

for(char c='a'; c<=('a'+s-1); c++){
    string st;
    for(int i=1; i<=n; i++){
        st+="a"; st[st.length()-1]+=(c-'a');
    }
    cnt[c]=query(st);
}
string res;
for(int i=1; i<=n; i++){
    for(char c1='a'; c1<='z'; c1++){
        if(cnt[c1]==0){continue;}
        bool v=true;
        for(char c2='a'; (c2<='z') && (v==true) ; c2++){
            if( (cnt[c2]==0) || c2==c1){
                continue;
            }string s2="a"; s2[0]+=(c1-'a');
            for(int j=i+1; j<=n; j++){
                s2+="a"; s2[s2.length()-1]+=(c2-'a');
            }
                int ac=query(res+s2);
                if((ac-i)<cnt[c2]){
                    v=false;
                }
        }
        if(!v){continue;}
        res+="a"; res[res.length()-1]+=(c1-'a');
        cnt[c1]--;
    }
}
return res;
}

Compilation message

password.cpp: In function 'std::string guess(int, int)':
password.cpp:29:9: warning: array subscript has type 'char' [-Wchar-subscripts]
   29 |     cnt[c]=query(st);
      |         ^
password.cpp:34:16: warning: array subscript has type 'char' [-Wchar-subscripts]
   34 |         if(cnt[c1]==0){continue;}
      |                ^~
password.cpp:37:22: warning: array subscript has type 'char' [-Wchar-subscripts]
   37 |             if( (cnt[c2]==0) || c2==c1){
      |                      ^~
password.cpp:44:31: warning: array subscript has type 'char' [-Wchar-subscripts]
   44 |                 if((ac-i)<cnt[c2]){
      |                               ^~
password.cpp:50:13: warning: array subscript has type 'char' [-Wchar-subscripts]
   50 |         cnt[c1]--;
      |             ^~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB Token "mnaaaaaaaaaaaaaa" doesn't correspond to pattern "[a-o]{1,15}"
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB Token "bbbbbabaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa" doesn't correspond to pattern "[a-b]{1,50}"
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 67 ms 504 KB Token "klaaaaaaaaaaaaaaaaaaaaaaaaaaaa...aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa" doesn't correspond to pattern "[a-l]{1,1000}"
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB Token "mnaaaaaaaaaaaaaa" doesn't correspond to pattern "[a-o]{1,15}"
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB Token "mnaaaaaaaaaaaaaa" doesn't correspond to pattern "[a-o]{1,15}"
2 Halted 0 ms 0 KB -