oj.uz

답안 #784264

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784264 2023-07-15T23:07:05 Z tvladm2009 Xylophone (JOI18_xylophone) C++17
100 / 100
 100 ms 444 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
 
using namespace std;
 
/// i almost made my last submission to pass
 
const int N = 5000 + 7;
int n;
int d2[N];
int d3[N];
int dir[N];
bool same[N];
int a[N];
int b[N];
int where[N];
 
 
bool isok() {
  int mn = a[1];
  for (int i = 1; i < n; i++) {
    a[i + 1] = a[i] + dir[i] * d2[i];
    mn = min(mn, a[i + 1]);
  }
  for (int i = 1; i <= n; i++) {
    a[i] -= (mn - 1);
  }
  for (int i = 1; i <= n; i++) {
    where[i] = 0;
  }
  for (int i = 1; i <= n; i++) {
    if (a[i] < 1 || a[i] > n) {
      return false;
    }
    if (where[a[i]]) {
      return false;
    }
    where[a[i]] = i;
  }
  return where[1] <= where[n];
}
 
void solve(int nn) {
  n = nn;
  for (int i = 1; i + 1 <= n; i++) {
    d2[i] = query(i, i + 1);
  }
  for (int i = 1; i + 2 <= n; i++) {
    d3[i] = query(i, i + 2);
  }
  /**
 
  a[i] - a[i + 1] = +- d2[i]
 
  **/
  dir[1] = +1;
  for (int i = 1; i + 2 <= n; i++) {
    if (d2[i] + d2[i + 1] == d3[i]) {
      /// direction[i] = direction[i + 1]
      dir[i + 1] = dir[i];
    } else {
      /// direction[i] != direction[i + 1]
      dir[i + 1] = -dir[i];
    }
  }
  if (!isok()) {
    for (int i = 1; i < n; i++) {
      dir[i] *= -1;
    }
    assert(isok());
  }
  for (int i = 1; i <= n; i++) {
    answer(i, a[i]);
  }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 316 KB Output is correct
5 Correct 2 ms 316 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 312 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 316 KB Output is correct
5 Correct 2 ms 316 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 312 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 7 ms 308 KB Output is correct
18 Correct 14 ms 296 KB Output is correct
19 Correct 20 ms 296 KB Output is correct
20 Correct 14 ms 304 KB Output is correct
21 Correct 19 ms 292 KB Output is correct
22 Correct 17 ms 440 KB Output is correct
23 Correct 13 ms 312 KB Output is correct
24 Correct 16 ms 308 KB Output is correct
25 Correct 13 ms 312 KB Output is correct
26 Correct 18 ms 316 KB Output is correct
27 Correct 16 ms 308 KB Output is correct
28 Correct 9 ms 316 KB Output is correct
29 Correct 17 ms 208 KB Output is correct
30 Correct 18 ms 312 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 316 KB Output is correct
5 Correct 2 ms 316 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 312 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 7 ms 308 KB Output is correct
18 Correct 14 ms 296 KB Output is correct
19 Correct 20 ms 296 KB Output is correct
20 Correct 14 ms 304 KB Output is correct
21 Correct 19 ms 292 KB Output is correct
22 Correct 17 ms 440 KB Output is correct
23 Correct 13 ms 312 KB Output is correct
24 Correct 16 ms 308 KB Output is correct
25 Correct 13 ms 312 KB Output is correct
26 Correct 18 ms 316 KB Output is correct
27 Correct 16 ms 308 KB Output is correct
28 Correct 9 ms 316 KB Output is correct
29 Correct 17 ms 208 KB Output is correct
30 Correct 18 ms 312 KB Output is correct
31 Correct 28 ms 292 KB Output is correct
32 Correct 46 ms 316 KB Output is correct
33 Correct 67 ms 316 KB Output is correct
34 Correct 83 ms 312 KB Output is correct
35 Correct 75 ms 316 KB Output is correct
36 Correct 38 ms 444 KB Output is correct
37 Correct 60 ms 300 KB Output is correct
38 Correct 90 ms 324 KB Output is correct
39 Correct 86 ms 308 KB Output is correct
40 Correct 74 ms 332 KB Output is correct
41 Correct 78 ms 312 KB Output is correct
42 Correct 62 ms 324 KB Output is correct
43 Correct 78 ms 324 KB Output is correct
44 Correct 86 ms 308 KB Output is correct
45 Correct 65 ms 312 KB Output is correct
46 Correct 86 ms 312 KB Output is correct
47 Correct 34 ms 420 KB Output is correct
48 Correct 91 ms 312 KB Output is correct
49 Correct 70 ms 320 KB Output is correct
50 Correct 46 ms 320 KB Output is correct
51 Correct 44 ms 316 KB Output is correct
52 Correct 72 ms 324 KB Output is correct
53 Correct 72 ms 316 KB Output is correct
54 Correct 62 ms 308 KB Output is correct
55 Correct 100 ms 316 KB Output is correct
56 Correct 35 ms 444 KB Output is correct
57 Correct 74 ms 316 KB Output is correct
58 Correct 82 ms 328 KB Output is correct
59 Correct 74 ms 312 KB Output is correct
60 Correct 85 ms 316 KB Output is correct