제출 #69693

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
69693	2018-08-21 11:45:52	E869120	곤돌라 (IOI14_gondola)	C++14	90 / 100	55 ms	7488 KiB

gondola

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 "gondola.h"
#include <vector>
#include <algorithm>
using namespace std;
int valid(int n, int inputSeq[]) {
  vector<int>vec(250009, 0);
  for (int i = 0; i < n; i++) vec[inputSeq[i]]++;
  for (int i = 0; i <= 250000; i++) { if (vec[i] >= 2) return 0; }
  for (int i = 0; i < n; i++) { if (inputSeq[i] > n) inputSeq[i] = -1; }
  int v = -1;
  for (int i = 0; i < n; i++) {
    if (inputSeq[i] != -1) {
      int z = (inputSeq[i] - i + n) % n;
      if (v == -1) v = z;
      else if (v != z) return 0;
    }
  }
  return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
  vector<int>vec(250009, -1);
  int r = -1, maxn = 0;
  for (int i = 0; i < n; i++) {
    maxn = max(maxn, gondolaSeq[i]); vec[gondolaSeq[i]] = i;
    if (gondolaSeq[i] > n) continue;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 5 / 5
• Subtask 8: 15 / 15
• Subtask 9: 15 / 15
• Subtask 10: 0 / 10