oj.uz

Submission #1103187

# Submission time Handle Problem Language Result Execution time Memory
1103187 2024-10-20T13:05:22 Z horiaboeriu Mouse (info1cup19_mouse) C++17
0 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
const int MAXN = 256;
int v[MAXN + 1];
set<int> cand[MAXN + 1];
vector<int> q;
set<int> fr;
int rez2;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
static inline unsigned long long genrand() {
  return uniform_int_distribution<unsigned long long>(0, (unsigned long long)-1)(rng);
}
int query(vector<int> q);
void solve(int n) {
    int i, j, x, rez;
    for (i = 1; i <= n; i++) {
        for (j = 1; j <= n; j++) {
            cand[i].insert(j);
        }
    }
    for (i = 1; i <= n; i++) {
        while (cand[i].size() > 1) {
            fr.clear();
            for (j = 1; j <= n; j++) {
                fr.insert(j);
            }
            q.clear();
            for (j = 1; j < i; j++) {
                q.push_back(v[j]);
                fr.erase(v[j]);
            }

            x = genrand() % n + 1;
            auto poz = cand[i].lower_bound(x);
            if (poz == cand[i].end()) {
                poz--;
            }
            q.push_back(*poz);//candidat random
            fr.erase(q[i - 1]);
            //in q sunt indexate de la 0
            for (j = i + 1; j <= n; j++) {
                x = genrand() % n + 1;
                auto poz = fr.lower_bound(x);
                if (poz == fr.end()) {
                    poz--;
                }
                x = *poz;
                q.push_back(x);
                fr.erase(x);
            }

            rez = query(q);
            rez2++;
            if (rez == i - 1) {
                //nu sunt pe pozitiile bune cei de la i la n
                for (j = i; j <= n; j++) {
                    cand[j].erase(q[j - 1]);
                }
            } else if (rez == n) {
                //am gasit permutarea
                for (j = 1; j <= n; j++) {
                    cand[j].clear();
                }
            }
        }

        v[i] = *cand[i].begin();
        for (j = i + 1; j <= n; j++) {
            cand[j].erase(v[i]);
        }
    }
}

Subtask #1
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Correct! Number of queries: 55
2 Correct 1 ms 336 KB Correct! Number of queries: 4
3 Correct 1 ms 336 KB Correct! Number of queries: 28
4 Correct 1 ms 336 KB Correct! Number of queries: 54
5 Incorrect 1 ms 336 KB Unexpected end of file - int32 expected
6 Halted 0 ms 0 KB -

Subtask #2
0.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Correct! Number of queries: 55
2 Correct 1 ms 336 KB Correct! Number of queries: 4
3 Correct 1 ms 336 KB Correct! Number of queries: 28
4 Correct 1 ms 336 KB Correct! Number of queries: 54
5 Incorrect 1 ms 336 KB Unexpected end of file - int32 expected
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Correct! Number of queries: 55
2 Correct 1 ms 336 KB Correct! Number of queries: 4
3 Correct 1 ms 336 KB Correct! Number of queries: 28
4 Correct 1 ms 336 KB Correct! Number of queries: 54
5 Incorrect 1 ms 336 KB Unexpected end of file - int32 expected
6 Halted 0 ms 0 KB -