oj.uz

답안 #128294

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
128294 2019-07-10T16:04:41 Z miguel Xylophone (JOI18_xylophone) C++14
47 / 100
 97 ms 516 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;

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]=q[mn-1]+1;
    t[mn+1]=q[mn]+1;
    if(mx<n) t[mx+1]=n-q[mx];
    t[mx-1]=n-q[mx-1];
    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 408 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 320 KB Output is correct
4 Correct 4 ms 248 KB Output is correct
5 Correct 3 ms 320 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 248 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 3 ms 320 KB Output is correct
10 Correct 5 ms 332 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 3 ms 404 KB Output is correct
15 Correct 4 ms 376 KB Output is correct

Subtask #2
36.0 / 36.0

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

Subtask #3
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 408 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 320 KB Output is correct
4 Correct 4 ms 248 KB Output is correct
5 Correct 3 ms 320 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 248 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 3 ms 320 KB Output is correct
10 Correct 5 ms 332 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 3 ms 404 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 7 ms 504 KB Output is correct
17 Correct 7 ms 328 KB Output is correct
18 Correct 22 ms 380 KB Output is correct
19 Correct 23 ms 428 KB Output is correct
20 Correct 22 ms 376 KB Output is correct
21 Correct 24 ms 248 KB Output is correct
22 Correct 24 ms 376 KB Output is correct
23 Correct 21 ms 248 KB Output is correct
24 Correct 21 ms 376 KB Output is correct
25 Correct 23 ms 376 KB Output is correct
26 Correct 21 ms 248 KB Output is correct
27 Correct 13 ms 400 KB Output is correct
28 Correct 28 ms 248 KB Output is correct
29 Correct 24 ms 248 KB Output is correct
30 Correct 19 ms 376 KB Output is correct
31 Correct 43 ms 504 KB Output is correct
32 Correct 71 ms 376 KB Output is correct
33 Correct 83 ms 428 KB Output is correct
34 Incorrect 97 ms 516 KB Wrong Answer [2]
35 Halted 0 ms 0 KB -