oj.uz

Submission #939798

# Submission time Handle Problem Language Result Execution time Memory
939798 2024-03-06T18:59:44 Z AdamGS Lockpicking (IOI23_lockpicking) C++17
21 / 100
 1000 ms 348 KB 
#include "lockpicking.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
void construct_card(int N, vector<int>A, vector<vector<int>>S) {
  vector<int>B=A;
  vector<vector<int>>T=S;
  int k=1;
  vector<int>odw(N);
  for(int i=1; i<N; ++i) {
    int p=i, s=0;
    int ile=0;
    while(p!=s%N && ile<N) {
      ++ile;
      if(A[p]!=B[s] && !odw[s]) {
        rep(j, N) {
          B.pb(A[j]);
          T.pb({S[j][0]+k*N, S[j][1]+k*N});
        }
        T[s][A[p]]=S[p][B[s]]+k*N;
        ++k;
        odw[s]=1;
      }
      int x=A[p], y=B[s];
      p=S[p][y];
      s=T[s][x];
      if(x!=y) ile=0;
    }
  }
  define_states(N*k, B, T, 0);
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
2 Correct 0 ms 348 KB ok, most errors: 0 (allowed: 1)
3 Correct 0 ms 348 KB ok, most errors: 0 (allowed: 1)
4 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
5 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
6 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
7 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
8 Correct 1 ms 348 KB ok, most errors: 1 (allowed: 1)
9 Correct 1 ms 344 KB ok, most errors: 1 (allowed: 1)
10 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
11 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
12 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)

Subtask #2
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB ok, most errors: 4 (allowed: 29)
2 Execution timed out 1093 ms 348 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1018 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
2 Correct 0 ms 348 KB ok, most errors: 0 (allowed: 1)
3 Correct 0 ms 348 KB ok, most errors: 0 (allowed: 1)
4 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
5 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
6 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
7 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
8 Correct 1 ms 348 KB ok, most errors: 1 (allowed: 1)
9 Correct 1 ms 344 KB ok, most errors: 1 (allowed: 1)
10 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
11 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
12 Correct 0 ms 348 KB ok, most errors: 1 (allowed: 1)
13 Correct 1 ms 348 KB ok, most errors: 4 (allowed: 29)
14 Execution timed out 1093 ms 348 KB Time limit exceeded
15 Halted 0 ms 0 KB -