Submission #1170853

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1170853	2025-03-20 09:11:49	fesdrer	Shuffle (NOI19_shuffle)	C++17	100 / 100	70 ms	584 KiB

shuffle

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 "shuffle.h"
#include <bits/stdc++.h>
using namespace std;
namespace Solve1{
  int to[5][1005];
  void get(vector<vector<int>> rlt,int id){
    for(vector<int> i:rlt)  to[id][i[0]]=i[1],to[id][i[1]]=i[0];
  }
  vector<int> solve1(int n){
    vector<vector<int>> tmp(0);
    for(int i=1;i<=n;i+=2)  tmp.push_back({i,i+1});
    vector<vector<int>> rlt=shuffle(tmp);
    get(rlt,1);
    tmp.clear();
    for(int i=2;i<n;i+=2) tmp.push_back({i,i+1});
    tmp.push_back({n,1});
    rlt=shuffle(tmp);
    get(rlt,2);
    tmp.clear(),tmp.push_back({1,3}),tmp.push_back({2,4});
    for(int i=5;i<=n;i+=2)  tmp.push_back({i,i+1});
    rlt=shuffle(tmp);
    get(rlt,3);
    tmp.clear(),tmp.push_back({2,4}),tmp.push_back({3,5});
    for(int i=6;i<n;i+=2) tmp.push_back({i,i+1});
    tmp.push_back({n,1});
    rlt=shuffle(tmp);
    get(rlt,4);
    vector<int> ret(0);
    int st=0;
    for(int i=1;i<=n;i++) if(to[3][i]!=to[1][i]&&to[4][i]==to[2][i]){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 2 / 2
• Subtask 2: 3 / 3
• Subtask 3: 12 / 12
• Subtask 4: 16 / 16
• Subtask 5: 15 / 15
• Subtask 6: 52 / 52