oj.uz

Submission #704346

# Submission time Handle Problem Language Result Execution time Memory
704346 2023-03-02T04:02:32 Z vjudge1 Xylophone (JOI18_xylophone) C++17
100 / 100
 98 ms 448 KB 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
// lethal option
 
#include "xylophone.h"
#include<bits/stdc++.h>
using namespace std;
 
#define all(flg) flg.begin(), flg.end()
#define pb push_back
#define fi first
#define se second
#define endl "\n"
#define eb emplace_back
#define ii pair<int, int>
#define vi vector<int>
#define PI 3.141592653589793238462643383279502884
#define ll long long
#define ld long double
#define for1(i, ff, gg) for(int i = ff; i <= gg; ++i)
#define for2(i, ff, gg) for(int i = ff; i >= gg; --i)
const ll mod = 1e9 + 7;
const int maxN = 300005;
const ll oo = 1e18 + 7;
int n, a[maxN];
int x, y, z, k;
 
int b[maxN];
int arr[maxN];
 
 
void solve(int N){
    n = N;
    for1(i, 1, n - 1) a[i] = query(i, i + 1);
    b[1] = 1;
    for1(i, 1, n - 2){
        if(query(i, i + 2) == a[i] + a[i + 1]) b[i + 1] = b[i];
        else b[i + 1] = -b[i];
    }
    a[n] = 0;
    int mn = 0;
    for2(i, n - 1, 1){
        a[i] = a[i + 1] - b[i] * a[i];
        mn = min(mn, a[i]);
    }
    for1(i, 1, n) a[i] = a[i] - mn + 1;
    for1(i, 1, n){
        if(a[i] == 1) break;
        if(a[i] == n){
            for1(i, 1, n) a[i] = n + 1 - a[i];
            break;
        }
    }
    for1(i, 1, n) answer(i, a[i]);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 2 ms 312 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 308 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 3 ms 312 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 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 312 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 2 ms 312 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 308 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 3 ms 312 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 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 312 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 4 ms 312 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 13 ms 300 KB Output is correct
19 Correct 17 ms 312 KB Output is correct
20 Correct 19 ms 308 KB Output is correct
21 Correct 12 ms 324 KB Output is correct
22 Correct 17 ms 316 KB Output is correct
23 Correct 17 ms 316 KB Output is correct
24 Correct 14 ms 208 KB Output is correct
25 Correct 16 ms 320 KB Output is correct
26 Correct 26 ms 312 KB Output is correct
27 Correct 16 ms 308 KB Output is correct
28 Correct 13 ms 208 KB Output is correct
29 Correct 18 ms 312 KB Output is correct
30 Correct 20 ms 308 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 2 ms 312 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 308 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 3 ms 312 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 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 312 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 4 ms 312 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 13 ms 300 KB Output is correct
19 Correct 17 ms 312 KB Output is correct
20 Correct 19 ms 308 KB Output is correct
21 Correct 12 ms 324 KB Output is correct
22 Correct 17 ms 316 KB Output is correct
23 Correct 17 ms 316 KB Output is correct
24 Correct 14 ms 208 KB Output is correct
25 Correct 16 ms 320 KB Output is correct
26 Correct 26 ms 312 KB Output is correct
27 Correct 16 ms 308 KB Output is correct
28 Correct 13 ms 208 KB Output is correct
29 Correct 18 ms 312 KB Output is correct
30 Correct 20 ms 308 KB Output is correct
31 Correct 51 ms 308 KB Output is correct
32 Correct 44 ms 296 KB Output is correct
33 Correct 80 ms 324 KB Output is correct
34 Correct 64 ms 440 KB Output is correct
35 Correct 75 ms 308 KB Output is correct
36 Correct 89 ms 328 KB Output is correct
37 Correct 96 ms 300 KB Output is correct
38 Correct 84 ms 348 KB Output is correct
39 Correct 71 ms 328 KB Output is correct
40 Correct 92 ms 332 KB Output is correct
41 Correct 86 ms 292 KB Output is correct
42 Correct 93 ms 336 KB Output is correct
43 Correct 85 ms 304 KB Output is correct
44 Correct 89 ms 312 KB Output is correct
45 Correct 70 ms 448 KB Output is correct
46 Correct 50 ms 300 KB Output is correct
47 Correct 81 ms 316 KB Output is correct
48 Correct 88 ms 436 KB Output is correct
49 Correct 90 ms 304 KB Output is correct
50 Correct 38 ms 316 KB Output is correct
51 Correct 80 ms 296 KB Output is correct
52 Correct 72 ms 340 KB Output is correct
53 Correct 94 ms 332 KB Output is correct
54 Correct 88 ms 336 KB Output is correct
55 Correct 71 ms 420 KB Output is correct
56 Correct 79 ms 432 KB Output is correct
57 Correct 94 ms 308 KB Output is correct
58 Correct 87 ms 312 KB Output is correct
59 Correct 98 ms 336 KB Output is correct
60 Correct 94 ms 300 KB Output is correct