답안 #77089 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
77089	2018-09-20T21:59:07 Z	duality	Xylophone (JOI18_xylophone)	C++11	100 / 100	99 ms	724 KB

xylophone

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "xylophone.h"

int ans[5000];
void solve(int N) {
    int i;
    ans[0] = 0,ans[1] = query(1,2);
    int m = 0;
    for (i = 2; i < N; i++) {
        int x = query(i,i+1),y = query(i-1,i+1);
        if (max(ans[i-2],ans[i-1]+x)-min(ans[i-2],ans[i-1]) == y) ans[i] = ans[i-1]+x;
        else ans[i] = ans[i-1]-x;
        m = min(m,ans[i]);
    }
    int si,bi;
    for (i = 0; i < N; i++) {
        ans[i] -= m;
        if (ans[i] == 0) si = i;
        if (ans[i] == N-1) bi = i;
    }
    if (si > bi) {
        for (i = 0; i < N; i++) ans[i] = N-1-ans[i];
    }
    for (i = 0; i < N; i++) answer(i+1,ans[i]+1);
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:76:5: warning: 'bi' may be used uninitialized in this function [-Wmaybe-uninitialized]
     if (si > bi) {
     ^~
xylophone.cpp:76:5: warning: 'si' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	452 KB	Output is correct
3	Correct	2 ms	452 KB	Output is correct
4	Correct	4 ms	452 KB	Output is correct
5	Correct	4 ms	548 KB	Output is correct
6	Correct	3 ms	548 KB	Output is correct
7	Correct	3 ms	548 KB	Output is correct
8	Correct	3 ms	548 KB	Output is correct
9	Correct	3 ms	548 KB	Output is correct
10	Correct	3 ms	548 KB	Output is correct
11	Correct	4 ms	548 KB	Output is correct
12	Correct	3 ms	548 KB	Output is correct
13	Correct	4 ms	548 KB	Output is correct
14	Correct	3 ms	548 KB	Output is correct
15	Correct	3 ms	548 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	452 KB	Output is correct
3	Correct	2 ms	452 KB	Output is correct
4	Correct	4 ms	452 KB	Output is correct
5	Correct	4 ms	548 KB	Output is correct
6	Correct	3 ms	548 KB	Output is correct
7	Correct	3 ms	548 KB	Output is correct
8	Correct	3 ms	548 KB	Output is correct
9	Correct	3 ms	548 KB	Output is correct
10	Correct	3 ms	548 KB	Output is correct
11	Correct	4 ms	548 KB	Output is correct
12	Correct	3 ms	548 KB	Output is correct
13	Correct	4 ms	548 KB	Output is correct
14	Correct	3 ms	548 KB	Output is correct
15	Correct	3 ms	548 KB	Output is correct
16	Correct	5 ms	548 KB	Output is correct
17	Correct	10 ms	548 KB	Output is correct
18	Correct	13 ms	548 KB	Output is correct
19	Correct	18 ms	548 KB	Output is correct
20	Correct	15 ms	548 KB	Output is correct
21	Correct	19 ms	548 KB	Output is correct
22	Correct	18 ms	548 KB	Output is correct
23	Correct	14 ms	700 KB	Output is correct
24	Correct	11 ms	700 KB	Output is correct
25	Correct	10 ms	700 KB	Output is correct
26	Correct	11 ms	700 KB	Output is correct
27	Correct	18 ms	700 KB	Output is correct
28	Correct	10 ms	700 KB	Output is correct
29	Correct	7 ms	700 KB	Output is correct
30	Correct	10 ms	700 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	452 KB	Output is correct
3	Correct	2 ms	452 KB	Output is correct
4	Correct	4 ms	452 KB	Output is correct
5	Correct	4 ms	548 KB	Output is correct
6	Correct	3 ms	548 KB	Output is correct
7	Correct	3 ms	548 KB	Output is correct
8	Correct	3 ms	548 KB	Output is correct
9	Correct	3 ms	548 KB	Output is correct
10	Correct	3 ms	548 KB	Output is correct
11	Correct	4 ms	548 KB	Output is correct
12	Correct	3 ms	548 KB	Output is correct
13	Correct	4 ms	548 KB	Output is correct
14	Correct	3 ms	548 KB	Output is correct
15	Correct	3 ms	548 KB	Output is correct
16	Correct	5 ms	548 KB	Output is correct
17	Correct	10 ms	548 KB	Output is correct
18	Correct	13 ms	548 KB	Output is correct
19	Correct	18 ms	548 KB	Output is correct
20	Correct	15 ms	548 KB	Output is correct
21	Correct	19 ms	548 KB	Output is correct
22	Correct	18 ms	548 KB	Output is correct
23	Correct	14 ms	700 KB	Output is correct
24	Correct	11 ms	700 KB	Output is correct
25	Correct	10 ms	700 KB	Output is correct
26	Correct	11 ms	700 KB	Output is correct
27	Correct	18 ms	700 KB	Output is correct
28	Correct	10 ms	700 KB	Output is correct
29	Correct	7 ms	700 KB	Output is correct
30	Correct	10 ms	700 KB	Output is correct
31	Correct	34 ms	700 KB	Output is correct
32	Correct	50 ms	700 KB	Output is correct
33	Correct	50 ms	700 KB	Output is correct
34	Correct	73 ms	716 KB	Output is correct
35	Correct	79 ms	716 KB	Output is correct
36	Correct	41 ms	716 KB	Output is correct
37	Correct	91 ms	716 KB	Output is correct
38	Correct	78 ms	716 KB	Output is correct
39	Correct	65 ms	716 KB	Output is correct
40	Correct	76 ms	716 KB	Output is correct
41	Correct	74 ms	716 KB	Output is correct
42	Correct	91 ms	716 KB	Output is correct
43	Correct	50 ms	716 KB	Output is correct
44	Correct	82 ms	716 KB	Output is correct
45	Correct	42 ms	716 KB	Output is correct
46	Correct	77 ms	716 KB	Output is correct
47	Correct	44 ms	716 KB	Output is correct
48	Correct	72 ms	716 KB	Output is correct
49	Correct	99 ms	716 KB	Output is correct
50	Correct	88 ms	716 KB	Output is correct
51	Correct	71 ms	716 KB	Output is correct
52	Correct	82 ms	716 KB	Output is correct
53	Correct	73 ms	716 KB	Output is correct
54	Correct	47 ms	716 KB	Output is correct
55	Correct	78 ms	716 KB	Output is correct
56	Correct	78 ms	716 KB	Output is correct
57	Correct	77 ms	716 KB	Output is correct
58	Correct	74 ms	724 KB	Output is correct
59	Correct	52 ms	724 KB	Output is correct
60	Correct	82 ms	724 KB	Output is correct

답안 #77089

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 36.0 / 36.0

Subtask #3 53.0 / 53.0

Subtask #1
11.0 / 11.0

Subtask #2
36.0 / 36.0

Subtask #3
53.0 / 53.0