oj.uz

답안 #320957

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
320957 2020-11-10T10:49:43 Z zaneyu Xylophone (JOI18_xylophone) C++14
100 / 100
 161 ms 612 KB 
/*input
5
1 2 5 3 4
*/
#include "xylophone.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=5e3+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=(1e9+7);
const ll MOD2=1000002173;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b,ll MOD){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int two[maxn],three[maxn];
void solve(int n) {
    REP1(i,n-1){
        two[i]=query(i,i+1);
    } 
    REP1(i,n-2){
        three[i]=query(i,i+2);
    }
    int cur=0;
    pii mx={0,1},mn={0,1};
    int pv=1;
    REP1(i,n-1){
        if(i==1 or two[i-1]+two[i]==three[i-1]){
            cur+=pv*two[i];
        }
        else{
            pv=-pv;
            cur+=pv*two[i];
        }
        pii x={cur,i};
        //cout<<cur<<'\n';
        if(mx<x) mx=x;
        if(mn>x) mn=x;
    }
    if(mx.s<mn.s){
        mn.f=-mx.f;
        pv=-1;
    }
    else{
        pv=1;
    }
    cur=-mn.f+1;
    answer(1,cur);
    REP1(i,n-1){
        if(i==1 or two[i-1]+two[i]==three[i-1]){
            cur+=pv*two[i];
        }
        else{
            pv=-pv;
            cur+=pv*two[i];
        }
        answer(i+1,cur);
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 3 ms 364 KB Output is correct
6 Correct 3 ms 364 KB Output is correct
7 Correct 4 ms 364 KB Output is correct
8 Correct 4 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 3 ms 364 KB Output is correct
12 Correct 2 ms 388 KB Output is correct
13 Correct 3 ms 364 KB Output is correct
14 Correct 3 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 6 ms 364 KB Output is correct
17 Correct 12 ms 364 KB Output is correct
18 Correct 19 ms 512 KB Output is correct
19 Correct 23 ms 364 KB Output is correct
20 Correct 17 ms 364 KB Output is correct
21 Correct 23 ms 388 KB Output is correct
22 Correct 23 ms 364 KB Output is correct
23 Correct 25 ms 388 KB Output is correct
24 Correct 17 ms 364 KB Output is correct
25 Correct 18 ms 364 KB Output is correct
26 Correct 23 ms 388 KB Output is correct
27 Correct 27 ms 364 KB Output is correct
28 Correct 16 ms 364 KB Output is correct
29 Correct 23 ms 364 KB Output is correct
30 Correct 26 ms 384 KB Output is correct
31 Correct 46 ms 392 KB Output is correct
32 Correct 46 ms 388 KB Output is correct
33 Correct 50 ms 364 KB Output is correct
34 Correct 119 ms 392 KB Output is correct
35 Correct 121 ms 388 KB Output is correct
36 Correct 98 ms 364 KB Output is correct
37 Correct 64 ms 612 KB Output is correct
38 Correct 74 ms 364 KB Output is correct
39 Correct 134 ms 484 KB Output is correct
40 Correct 117 ms 364 KB Output is correct
41 Correct 112 ms 384 KB Output is correct
42 Correct 102 ms 364 KB Output is correct
43 Correct 122 ms 364 KB Output is correct
44 Correct 123 ms 484 KB Output is correct
45 Correct 92 ms 364 KB Output is correct
46 Correct 94 ms 524 KB Output is correct
47 Correct 96 ms 364 KB Output is correct
48 Correct 118 ms 484 KB Output is correct
49 Correct 96 ms 364 KB Output is correct
50 Correct 119 ms 364 KB Output is correct
51 Correct 106 ms 364 KB Output is correct
52 Correct 90 ms 484 KB Output is correct
53 Correct 75 ms 504 KB Output is correct
54 Correct 118 ms 364 KB Output is correct
55 Correct 92 ms 384 KB Output is correct
56 Correct 75 ms 364 KB Output is correct
57 Correct 90 ms 364 KB Output is correct
58 Correct 161 ms 364 KB Output is correct
59 Correct 119 ms 508 KB Output is correct
60 Correct 128 ms 364 KB Output is correct