oj.uz

Submission #666313

# Submission time Handle Problem Language Result Execution time Memory
666313 2022-11-28T07:45:50 Z Nursik Password (RMI18_password) C++14
30 / 100
 402 ms 336 KB 
#include <stdio.h>
 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
 
using namespace std;
 
#define ll long long
#define pb push_back
 

int ix[30], adx[10000], lst[10000];
char y[10000];
int query(string str);
string guess(int n, int s){
    string ans =  "";
    int mx = 0, c = -1;
    for (int i = 0; i < s; ++i){
        string kek = "";
        char ch = 'a';
        ch += i;
        for (int j = 1; j <= n; ++j){
            kek += ch;
        }
        ix[i] = query(kek);
        if (ix[i] > mx){
            mx = ix[i];
            c = i;
        }
    }
    for (int j = 1; j <= mx; ++j){
        char ch = 'a';
        ch += c;
        ans += ch;
    }
    ix[c] = 0;
    for (int i = 0; i < s; ++i){
        if (ix[i] == 0){
            continue;
        }
        char ch = 'a';
        ch += i;
        string nans = "";
        for (int j = 0; j < n; ++j){
            if (j < (int)ans.size()){
                y[j] = ans[j];
            }
            else{
                y[j] = ch;
            }
        }
        for (int j = (int)ans.size(); j >= 0; --j){
            string q = "";
            for (int k = 0; k < n; ++k){
                if (k < j){
                    q += ans[k];
                }
                else{
                    q += ch;
                }
            }
            int kek = query(q);
            kek -= j;
            adx[j] = kek - lst[j + 1];
            lst[j] = lst[j + 1] + adx[j];
        }
        for (int j = 0; j <= (int)ans.size(); ++j){
            while (adx[j] > 0){
                nans += ch;
                adx[j] -= 1;
            }
            if (j < (int)ans.size()){
                nans += ans[j];
            }
        }
        for (int j = 0; j < n; ++j){
            lst[j] = 0, adx[j] = 0;
        }
        ans = nans;
    }
    return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 208 KB Guessed the password with 135 queries.
2 Correct 3 ms 208 KB Guessed the password with 299 queries.

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Guessed the password with 30 queries.
2 Correct 1 ms 208 KB Guessed the password with 108 queries.
3 Runtime error 2 ms 208 KB Execution killed with signal 13
4 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 208 KB Guessed the password with 4717 queries.
2 Correct 173 ms 208 KB Guessed the password with 9564 queries.
3 Correct 218 ms 336 KB Guessed the password with 15223 queries.
4 Correct 402 ms 336 KB Guessed the password with 19305 queries.

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 208 KB Guessed the password with 135 queries.
2 Correct 3 ms 208 KB Guessed the password with 299 queries.
3 Correct 1 ms 212 KB Guessed the password with 30 queries.
4 Correct 1 ms 208 KB Guessed the password with 108 queries.
5 Runtime error 2 ms 208 KB Execution killed with signal 13
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 208 KB Guessed the password with 135 queries.
2 Correct 3 ms 208 KB Guessed the password with 299 queries.
3 Correct 1 ms 212 KB Guessed the password with 30 queries.
4 Correct 1 ms 208 KB Guessed the password with 108 queries.
5 Runtime error 2 ms 208 KB Execution killed with signal 13
6 Halted 0 ms 0 KB -