oj.uz

Submission #99565

# Submission time Handle Problem Language Result Execution time Memory
99565 2019-03-05T08:16:32 Z oolimry Xylophone (JOI18_xylophone) C++14
100 / 100
 92 ms 544 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int N) {
    int n = N;
	int two[n];
	int three[n];
	for(int i = 1;i < n;i++){
        two[i] = query(i,i+1);
	}
	for(int i = 2;i < n;i++){
        three[i] = query(i-1,i+1);
	}

	int arr[n];
	arr[0] = 0;
	arr[1] = two[1];
    typedef pair<int,int> ii;

    for(int i = 2;i < n;i++){
        ///in between previous two
        ///i-1,i,i-2 or i-2,i,i-1
        if(three[i] == two[i-1]){
            if(arr[i-1] > arr[i-2]){
                arr[i] = arr[i-1] - two[i];
            }
            else{
                arr[i] = arr[i-1] + two[i];
            }
        }
        else{
            ///i-2 is the middle element
            ///i,i-2,i-1 or i-1,i-2,1
            if(three[i] == two[i]){
                if(arr[i-1] > arr[i-2]){
                    arr[i] = arr[i-1] - two[i];
                }
                else{
                    arr[i] = arr[i-1] + two[i];
                }
            }
            ///i-1 is the middle element
            ///i,i-1,i-2 or i-2,i-1,i
            else{
                if(arr[i-1] > arr[i-2]){
                    arr[i] = arr[i-1] + two[i];
                }
                else{
                    arr[i] = arr[i-1] - two[i];
                }
            }
        }
    }

    ii v[n];
    for(int i = 0;i < n;i++){
        v[i] = ii(arr[i],i+1);
    }
    sort(v,v+n);
    if(v[0].second > v[n-1].second){
        for(int i = 0;i < n;i++){
            v[i].first *= -1;
        }
    }

    int minval = n+1;
    for(int i = 0;i < n;i++){
        minval = min(minval,v[i].first);
    }
    int diff = 1 - minval;
    for(int i = 0;i < n;i++){
        v[i].first += diff;
    }
	for(int i = 0;i < n;i++){
        //printf("%d %d\n",v[i].first,v[i].second);
        answer(v[i].second,v[i].first);
	}

}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 3 ms 256 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 4 ms 384 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 3 ms 256 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 9 ms 384 KB Output is correct
18 Correct 21 ms 256 KB Output is correct
19 Correct 17 ms 324 KB Output is correct
20 Correct 20 ms 256 KB Output is correct
21 Correct 14 ms 324 KB Output is correct
22 Correct 16 ms 256 KB Output is correct
23 Correct 19 ms 256 KB Output is correct
24 Correct 16 ms 256 KB Output is correct
25 Correct 22 ms 424 KB Output is correct
26 Correct 17 ms 256 KB Output is correct
27 Correct 17 ms 256 KB Output is correct
28 Correct 19 ms 256 KB Output is correct
29 Correct 16 ms 384 KB Output is correct
30 Correct 18 ms 256 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 3 ms 256 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 9 ms 384 KB Output is correct
18 Correct 21 ms 256 KB Output is correct
19 Correct 17 ms 324 KB Output is correct
20 Correct 20 ms 256 KB Output is correct
21 Correct 14 ms 324 KB Output is correct
22 Correct 16 ms 256 KB Output is correct
23 Correct 19 ms 256 KB Output is correct
24 Correct 16 ms 256 KB Output is correct
25 Correct 22 ms 424 KB Output is correct
26 Correct 17 ms 256 KB Output is correct
27 Correct 17 ms 256 KB Output is correct
28 Correct 19 ms 256 KB Output is correct
29 Correct 16 ms 384 KB Output is correct
30 Correct 18 ms 256 KB Output is correct
31 Correct 49 ms 256 KB Output is correct
32 Correct 45 ms 460 KB Output is correct
33 Correct 34 ms 344 KB Output is correct
34 Correct 50 ms 376 KB Output is correct
35 Correct 77 ms 384 KB Output is correct
36 Correct 74 ms 384 KB Output is correct
37 Correct 85 ms 496 KB Output is correct
38 Correct 59 ms 456 KB Output is correct
39 Correct 54 ms 384 KB Output is correct
40 Correct 80 ms 356 KB Output is correct
41 Correct 82 ms 344 KB Output is correct
42 Correct 92 ms 324 KB Output is correct
43 Correct 88 ms 428 KB Output is correct
44 Correct 74 ms 380 KB Output is correct
45 Correct 49 ms 424 KB Output is correct
46 Correct 65 ms 544 KB Output is correct
47 Correct 87 ms 384 KB Output is correct
48 Correct 77 ms 340 KB Output is correct
49 Correct 70 ms 336 KB Output is correct
50 Correct 60 ms 344 KB Output is correct
51 Correct 75 ms 336 KB Output is correct
52 Correct 82 ms 424 KB Output is correct
53 Correct 44 ms 420 KB Output is correct
54 Correct 70 ms 328 KB Output is correct
55 Correct 47 ms 480 KB Output is correct
56 Correct 86 ms 424 KB Output is correct
57 Correct 40 ms 412 KB Output is correct
58 Correct 75 ms 332 KB Output is correct
59 Correct 81 ms 376 KB Output is correct
60 Correct 37 ms 532 KB Output is correct