oj.uz

Submission #663894

# Submission time Handle Problem Language Result Execution time Memory
663894 2022-11-27T05:31:26 Z Nursik Password (RMI18_password) C++14
0 / 100
 1 ms 208 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 is[30];
int query(string str);
string guess(int n, int s){
    char k = 'a';
    k += s;
    string nw = "";
    nw += k;
    return nw;
    string ans = "";
    int mx = 0, c = -1;
    for (int i = 0; i < s; ++i){
        string lol = "";
        char ch = 'a';
        ch += i;
        for (int j = 1; j <= n; ++j){
            lol += ch;
        }
        int kek = query(lol);
        if (kek > mx){
            mx = kek;
            c = i;
        }
        is[i] = kek;
    }
    for (int j = 1; j <= mx; ++j){
        char ch = 'a';
        ch += c;
        ans += ch;
    }
    is[c] = 0;
    for (int i = 0; i < s; ++i){
        if (is[i] == 0){
            continue;
        }
        while (is[i] > 0){
            char ch = 'a';
            ch += i;
            int len = (int)ans.size();
            string nans = "";
            for (int j = 0; j <= len; ++j){
                string add = "";
                for (int k = 1; k <= is[i]; ++k){
                    add += ch;
                }
                string q = "";
                for (int k = 0; k < j; ++k){
                    q += ans[k];
                }
                q += add;
                for (int k = j; k < len; ++k){
                    q += ans[k];
                }
                if ((int)q.size() <= n){
                    int kek = query(q);
                    if (kek > len){
                        int x = kek - len;
                        is[i] -= x;
                        for (int j = 1; j <= x; ++j){
                            nans += ch;
                        }
                    }
                }
                if (j < len)
                    nans += ans[j];
            }
            ans = nans;
        }
    }
    return ans;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Token "p" doesn't correspond to pattern "[a-o]{1,15}"
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Token "c" doesn't correspond to pattern "[a-b]{1,50}"
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Token "m" doesn't correspond to pattern "[a-l]{1,1000}"
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Token "p" doesn't correspond to pattern "[a-o]{1,15}"
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Token "p" doesn't correspond to pattern "[a-o]{1,15}"
2 Halted 0 ms 0 KB -