oj.uz

답안 #139752

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
139752 2019-08-01T11:08:25 Z rzbt Xylophone (JOI18_xylophone) C++14
100 / 100
 113 ms 536 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#include "xylophone.h"
using namespace std;
#define MAXN 5003
int niz[MAXN];
bool znak[MAXN];
int delta[MAXN];
void solve(int n)
{
    niz[1]=0;
    delta[2]=query(1,2);
    niz[2]=delta[2];

    for(int i=3;i<=n;i++){
        int x=query(i-2,i);
        delta[i]=query(i-1,i);
        int y=delta[i];

        if(x==abs(niz[i-1]-niz[i-2])){
            if(niz[i-2]<niz[i-1])niz[i]=niz[i-1]-y;
            else{
                niz[i]=niz[i-1]+y;
                znak[i]=true;
            }
        }else{
            if(niz[i-2]<niz[i-1]){
                if(x==y+abs(niz[i-1]-niz[i-2])){
                    niz[i]=niz[i-1]+y;
                    znak[i]=true;
                }
                else niz[i]=niz[i-1]-y;
            }else{
                if(x==y+abs(niz[i-1]-niz[i-2]))niz[i]=niz[i-1]-y;
                else {
                    niz[i]=niz[i-1]+y;
                    znak[i]=true;
                }
            }

        }
    }
    int mi=1;
    for(int i=1;i<=n;i++)
        if(niz[i]<niz[mi])
            mi=i;

    int ma=1;
    for(int i=1;i<=n;i++)
        if(niz[i]>niz[ma])
            ma=i;
    if(ma<mi){
        for(int i=2;i<=n;i++){
            niz[i]=-niz[i];
        }
    }
    mi=0;
    for(int i=1;i<=n;i++)
        mi=min(mi,niz[i]);
    for(int i=1;i<=n;i++)answer(i,niz[i]-mi+1);

}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 328 KB Output is correct
5 Correct 9 ms 448 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 3 ms 324 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 4 ms 296 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 3 ms 408 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 328 KB Output is correct
5 Correct 9 ms 448 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 3 ms 324 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 4 ms 296 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 3 ms 408 KB Output is correct
16 Correct 8 ms 376 KB Output is correct
17 Correct 7 ms 324 KB Output is correct
18 Correct 10 ms 320 KB Output is correct
19 Correct 25 ms 376 KB Output is correct
20 Correct 14 ms 324 KB Output is correct
21 Correct 16 ms 404 KB Output is correct
22 Correct 12 ms 320 KB Output is correct
23 Correct 27 ms 376 KB Output is correct
24 Correct 24 ms 248 KB Output is correct
25 Correct 25 ms 380 KB Output is correct
26 Correct 21 ms 248 KB Output is correct
27 Correct 22 ms 248 KB Output is correct
28 Correct 12 ms 536 KB Output is correct
29 Correct 22 ms 248 KB Output is correct
30 Correct 21 ms 252 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 328 KB Output is correct
5 Correct 9 ms 448 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 3 ms 324 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 4 ms 296 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 3 ms 408 KB Output is correct
16 Correct 8 ms 376 KB Output is correct
17 Correct 7 ms 324 KB Output is correct
18 Correct 10 ms 320 KB Output is correct
19 Correct 25 ms 376 KB Output is correct
20 Correct 14 ms 324 KB Output is correct
21 Correct 16 ms 404 KB Output is correct
22 Correct 12 ms 320 KB Output is correct
23 Correct 27 ms 376 KB Output is correct
24 Correct 24 ms 248 KB Output is correct
25 Correct 25 ms 380 KB Output is correct
26 Correct 21 ms 248 KB Output is correct
27 Correct 22 ms 248 KB Output is correct
28 Correct 12 ms 536 KB Output is correct
29 Correct 22 ms 248 KB Output is correct
30 Correct 21 ms 252 KB Output is correct
31 Correct 53 ms 376 KB Output is correct
32 Correct 66 ms 440 KB Output is correct
33 Correct 60 ms 324 KB Output is correct
34 Correct 58 ms 400 KB Output is correct
35 Correct 105 ms 376 KB Output is correct
36 Correct 112 ms 432 KB Output is correct
37 Correct 57 ms 376 KB Output is correct
38 Correct 113 ms 248 KB Output is correct
39 Correct 96 ms 376 KB Output is correct
40 Correct 102 ms 344 KB Output is correct
41 Correct 61 ms 424 KB Output is correct
42 Correct 101 ms 376 KB Output is correct
43 Correct 104 ms 464 KB Output is correct
44 Correct 111 ms 248 KB Output is correct
45 Correct 111 ms 376 KB Output is correct
46 Correct 111 ms 376 KB Output is correct
47 Correct 71 ms 388 KB Output is correct
48 Correct 84 ms 344 KB Output is correct
49 Correct 71 ms 324 KB Output is correct
50 Correct 55 ms 380 KB Output is correct
51 Correct 76 ms 428 KB Output is correct
52 Correct 103 ms 344 KB Output is correct
53 Correct 97 ms 404 KB Output is correct
54 Correct 94 ms 376 KB Output is correct
55 Correct 87 ms 460 KB Output is correct
56 Correct 85 ms 504 KB Output is correct
57 Correct 103 ms 348 KB Output is correct
58 Correct 82 ms 392 KB Output is correct
59 Correct 74 ms 376 KB Output is correct
60 Correct 110 ms 484 KB Output is correct