Submission #842626

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
842626	2023-09-03 06:26:18	WLZ	Lockpicking (IOI23_lockpicking)	C++17	100 / 100	172 ms	3272 KiB

lockpicking

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "lockpicking.h"
#include <bits/stdc++.h>
using namespace std;
void construct_card(int n, std::vector<int> a, std::vector<std::vector<int>> s) {
  srand(time(nullptr));
  vector<int> b = a; vector< vector<int> > t = s;
  vector<int> seq(n, 0); int best = 0;
  for (int k = 0; k < 1000; k++) {
    vector<int> new_seq(n, 0);
    for (int i = 0; i < n; i++) new_seq[i] = rand() % 2;
    set<string> st;
    for (int i = 0; i < n; i++) {
      string tmp(1, a[i] + '0');
      for (int l = 0, cur = s[i][new_seq[0]]; l < n; l++) {
        tmp += a[cur] + '0';
        cur = s[cur][new_seq[(l + 1) % n]];
      }
      st.insert(tmp);
    }
    if ((int) st.size() >= best) {
      best = (int) st.size();
      seq = new_seq;
    }
  }
  //for (auto &x : seq) cerr << x << ' ';
  //cerr << endl;
  vector< vector< vector< pair<int, int> > > > potential = {{}};
  for (int i = 0; i < n; i++) {
    vector< pair<int, int> > tmp = {{a[i], i}};
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 21 / 21
• Subtask 2: 30 / 30
• Subtask 3: 20 / 20
• Subtask 4: 29 / 29