oj.uz

답안 #128291

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
128291 2019-07-10T16:01:59 Z miguel Xylophone (JOI18_xylophone) C++14
47 / 100
 96 ms 532 KB 
#include<bits/stdc++.h>
#include <xylophone.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <int, pi>
#define vi vector <int>
const ll mod = 1e9 + 7;
int n, a[5001];

void solve(int n){
    int t[5001], q[5003];
    for(int i=1; i<n; i++) q[i]=query(i, i+1);
    int l=1, r=n;
    while(r-l>1){
        int mid=(l+r)/2;
        if(query(1, mid)!=n-1) l=mid;
        else r=mid;
    }
    int mx=r;
    l=1, r=mx;
    while(r-l>1){
        int mid=(l+r)/2;
        if(query(mid, mx)!=n-1) r=mid;
        else l=mid;
    }
    int mn=l;
    t[mn]=1, t[mx]=n;
    if(mn>1) t[mn-1]=query(mn-1, mn)+1;
    t[mn+1]=query(mn, mn+1)+1;
    if(mx<n) t[mx+1]=n-query(mx, mx+1);
    t[mx-1]=n-query(mx-1, mx);
    for(int i=mn-1; i>=2; i--){
        int q1=query(i-1, i+1), q2=q[i-1], q3=q[i];
        if(q1==q2+q3){
            if(t[i+1]>t[i]) t[i-1]=t[i]-q2;
            else t[i-1]=t[i]+q2;
        }
        else{
            if(t[i+1]>t[i]) t[i-1]=t[i]+q2;
            else t[i-1]=t[i]-q2;
        }
    }
    for(int i=mn+1; i<=mx-2; i++){
        int q1=query(i-1, i+1), q2=q[i-1], q3=q[i];
        if(q1==q2+q3){//cout<<i<<"mamamia"<<endl;
            if(t[i-1]>t[i]) t[i+1]=t[i]-q3;
            else t[i+1]=t[i]+q3;
        }
        else{
            if(t[i-1]>t[i]) t[i+1]=t[i]+q3;
            else t[i+1]=t[i]-q3;
        }
    }
    for(int i=mx+1; i<=n-1; i++){
        int q1=query(i-1, i+1), q2=q[i-1], q3=q[i];
        if(q1==q2+q3){
            if(t[i-1]>t[i]) t[i+1]=t[i]-q3;
            else t[i+1]=t[i]+q3;
        }
        else{
            if(t[i-1]>t[i]) t[i+1]=t[i]+q3;
            else t[i+1]=t[i]-q3;
        }
    }
    //for(int i=1; i<=n; i++) cout<<t[i]<<"x ";
    for(int i=1; i<=n; i++) answer(i, t[i]);
    //cout<<mn<<" "<<mx<<endl;
}

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 4 ms 376 KB Output is correct
4 Correct 7 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 4 ms 248 KB Output is correct
10 Correct 4 ms 248 KB Output is correct
11 Correct 4 ms 324 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 2 ms 420 KB Output is correct
15 Correct 7 ms 376 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 4 ms 376 KB Output is correct
4 Correct 7 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 4 ms 248 KB Output is correct
10 Correct 4 ms 248 KB Output is correct
11 Correct 4 ms 324 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 2 ms 420 KB Output is correct
15 Correct 7 ms 376 KB Output is correct
16 Correct 8 ms 248 KB Output is correct
17 Correct 8 ms 332 KB Output is correct
18 Correct 32 ms 428 KB Output is correct
19 Correct 31 ms 376 KB Output is correct
20 Correct 26 ms 408 KB Output is correct
21 Correct 30 ms 504 KB Output is correct
22 Correct 19 ms 376 KB Output is correct
23 Correct 23 ms 376 KB Output is correct
24 Correct 14 ms 324 KB Output is correct
25 Correct 24 ms 424 KB Output is correct
26 Correct 23 ms 336 KB Output is correct
27 Correct 38 ms 532 KB Output is correct
28 Correct 31 ms 376 KB Output is correct
29 Correct 23 ms 376 KB Output is correct
30 Correct 24 ms 248 KB Output is correct

Subtask #3
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 4 ms 376 KB Output is correct
4 Correct 7 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 4 ms 248 KB Output is correct
10 Correct 4 ms 248 KB Output is correct
11 Correct 4 ms 324 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 2 ms 420 KB Output is correct
15 Correct 7 ms 376 KB Output is correct
16 Correct 8 ms 248 KB Output is correct
17 Correct 8 ms 332 KB Output is correct
18 Correct 32 ms 428 KB Output is correct
19 Correct 31 ms 376 KB Output is correct
20 Correct 26 ms 408 KB Output is correct
21 Correct 30 ms 504 KB Output is correct
22 Correct 19 ms 376 KB Output is correct
23 Correct 23 ms 376 KB Output is correct
24 Correct 14 ms 324 KB Output is correct
25 Correct 24 ms 424 KB Output is correct
26 Correct 23 ms 336 KB Output is correct
27 Correct 38 ms 532 KB Output is correct
28 Correct 31 ms 376 KB Output is correct
29 Correct 23 ms 376 KB Output is correct
30 Correct 24 ms 248 KB Output is correct
31 Correct 45 ms 340 KB Output is correct
32 Correct 35 ms 376 KB Output is correct
33 Correct 80 ms 412 KB Output is correct
34 Incorrect 96 ms 252 KB Wrong Answer [2]
35 Halted 0 ms 0 KB -