Submission #674441

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
674441	2022-12-24 08:27:40	QwertyPi	Cat (info1cup19_cat)	C++14	100 / 100	403 ms	29224 KiB

cat

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 <bits/stdc++.h>
using namespace std;
int a[200001];
int b[200001];
int n;
int ans[200001][2], av = 0;
int o[200001], on = 0;
void f(int i, int j){
  ans[av][0] = i, ans[av++][1] = j;
  swap(a[i], a[j]);
  swap(b[a[i]], b[a[j]]);
  swap(a[n + 1 - i], a[n + 1 - j]);
  swap(b[a[n + 1 - i]], b[a[n + 1 - j]]);
}
void solve(){
  av = on = 0;
  cin >> n; for(int i = 1; i <= n; i++) cin >> a[i];
  for(int i = 1; i <= n / 2; i++){
    if(a[i] + a[n + 1 - i] != n + 1){
      cout << -1 << endl;
      return;
    }
  }
  for(int i = 1; i <= n; i++) b[a[i]] = i;
  for(int i = 1; i <= n / 2; i++){
    if(a[i] == i) continue;
    else if(a[i] == n + 1 - i) o[on++] = i;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 15 / 15
• Subtask 2: 10 / 10
• Subtask 3: 25 / 25
• Subtask 4: 15 / 15
• Subtask 5: 35 / 35