Submission #1131399

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1131399	2025-01-02 14:21:53	bachhoangxuan	Machine (IOI24_machine)	C++20	100 / 100	48 ms	452 KiB

machine

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 "machine.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> S={10,26,58,122};
std::vector<int> find_permutation(int N) {
  vector<int> s={0,1,2};
    for(int x:S) if(x==N) s[2]=4;
    vector<int> A;
    for(int i=0;i<=N+2;i++){
        if(i==s[0] || i==s[1] || i==s[2]) continue;
        A.push_back(i);
    }
    vector<int> B=use_machine(A);
    vector<int> C=A;
    sort(C.begin(),C.end());
    for(int x=0;x<256;x++){
        vector<int> D=B;
        for(int &y:D) y^=x;
        sort(D.begin(),D.end());
        if(C==D){
            for(int &y:B) y^=x;
            break;
        }
    }
    vector<int> pos(N+3);
    for(int i=0;i<N;i++) pos[A[i]]=i;
    vector<int> P(N);
    for(int i=0;i<N;i++) P[i]=pos[B[i]];
  return P;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 0: 0 / 0
• Subtask 1: 7 / 7
• Subtask 2: 12 / 12
• Subtask 3: 19 / 19
• Subtask 4: 21 / 21
• Subtask 5: 10 / 10
• Subtask 6: 31 / 31