oj.uz

답안 #755872

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
755872 2023-06-10T17:06:21 Z MohamedFaresNebili Password (RMI18_password) C++14
0 / 100
 180 ms 424 KB 
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <sstream>
#include <string>
#include <stdlib.h>
#include <assert.h>

using namespace std;

#define DEBUG 0
#define MAX_QUERIES 50000
#define MAX_N 5000
#define MAX_SIGMA 26

static string password;
static int n, s, numQueries;
static stringstream msg;

int query(string str);

        string guess(int n, int s) {
            string S(n, 'a');
            int freq[s], used[s]{0}; vector<int> p;
            for(int l = 0; l < s; l++) {
                for(int i = 0; i < n; i++)
                    S[i] = char(l + 'a');
                freq[l] = query(S);
                if(freq[l] > 0) p.push_back(l);
            }
            S = "";
            for(int l = 0; l < n; l++) {
                S.push_back('a');
                for(int i = 0; i < s; i++) {
                    if(used[i] == freq[i]) continue;
                    S[l] = char(i + 'a');
                    if(l < n - 1) {
                        used[i]++; int cnt = 0, tr = 0;
                        for(int j = 0; j < s; j++) {
                            if(used[j] == freq[j]) continue;
                            if(cnt < tr) { tr++; continue; }
                            tr++;
                            for(int e = used[j] + 1; e <= freq[j]; e++)
                                S.push_back(char(j + 'a'));
                            int R = query(S); R -= l;
                            cnt += (R == 1 + freq[j] - used[j]);
                            for(int e = used[j] + 1; e <= freq[j]; e++)
                                S.pop_back();
                        }
                        used[i]--;
                        if(cnt == tr){
                            used[i]++;
                            break;
                        }
                    }
                    else {
                        int K = query(S);
                        if(K == n) break;
                    }
                }
            }
            return S;
        }

Compilation message

password.cpp:17:18: warning: 'numQueries' defined but not used [-Wunused-variable]
   17 | static int n, s, numQueries;
      |                  ^~~~~~~~~~
password.cpp:17:15: warning: 's' defined but not used [-Wunused-variable]
   17 | static int n, s, numQueries;
      |               ^
password.cpp:17:12: warning: 'n' defined but not used [-Wunused-variable]
   17 | static int n, s, numQueries;
      |            ^

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 256 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 296 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 180 ms 424 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 256 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 256 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -