oj.uz

답안 #146557

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
146557 2019-08-24T11:29:48 Z brcode Xylophone (JOI18_xylophone) C++14
100 / 100
 110 ms 700 KB 
#include <iostream>
#include "xylophone.h"
using namespace std;
const int MAXN = 1e5+5;
int pairs[MAXN];
int triplets[MAXN];
int ord[MAXN][4];
int arr[MAXN];
int ans[MAXN];
 
/*int query(int a,int b){
    int mini = 1e9;
    int maxi = 0;
    for(int i=a;i<=b;i++){
        mini = min(mini,arr[i]);
        maxi = max(maxi,arr[i]);
    }
    return maxi-mini;
}
void answer(int i,int a){
    cout<<a<<" ";
}
bool check(int i,int j,int mini,int maxi){
    return query(i,j)==maxi-mini;
}*/
void solve(int n){
    for(int i=1;i<n;i++){
        pairs[i] = query(i,i+1);
       
    }
    for(int i=1;i<n-1;i++){
        triplets[i] = query(i,i+2);
        
    }
    ord[1][1] = 1;
    ord[1][0] = 0;
    for(int i=1;i<n-1;i++){
        if(triplets[i] == pairs[i]+pairs[i+1]){
            ord[i+1][1] = ord[i][1];
            ord[i+1][0] = ord[i][0];
        }else{
            ord[i+1][1] = !ord[i][1];
            ord[i+1][0] = !ord[i][0];
        }
      
    }
    ans[1] =1;
    int holdmin = 1e9;
    for(int i=2;i<=n;i++){
        if(ord[i-1][0] == 0){
            ans[i] = ans[i-1]-pairs[i-1];
        }else{
            ans[i] = ans[i-1]+pairs[i-1];
        }
       
        holdmin = min(holdmin,ans[i]);
       
    }
    
    for(int i=1;i<=n;i++){
      if(holdmin<=0){
         ans[i]+=abs(holdmin) + 1;
      }
       
        
    }
    
    bool ok = true;
    bool found = false;
    for(int i=1;i<=n;i++){
        if(i<n-1 && max(ans[i],max(ans[i+1],ans[i+2])) - min(ans[i],min(ans[i+1],ans[i+2]))!=triplets[i]){
            ok = false;
            break;
        }
        if(ans[i] == n){
            found = true;
        }
        if(ans[i] == 1  && found == true){
            ok = false;
            break;
        }
        
    }
  /*  for(int i=1;i<=n;i++){
        int maxi = arr[i];
        int mini = arr[i];
        for(int j=i+1;j<=n;j++){
            maxi = max(arr[j],maxi);
            mini = min(arr[j],mini);
            if(!check(i,j,mini,maxi)){
               // cout<<i<<" "<<j<<" "<<query(i,j)<<" "<<maxi-mini<<endl;
            }
        }
    }*/
    if(ok){
        for(int i=1;i<=n;i++){
            answer(i,ans[i]);
        }
        return;
    }
    ans[1] =1;
    holdmin = 1e9;
    for(int i=2;i<=n;i++){
        if(ord[i-1][1]){
            ans[i] = ans[i-1]+pairs[i-1];
        }else{
            ans[i] = ans[i-1]-pairs[i-1];
        }
        holdmin = min(holdmin,ans[i]);
       
     //   cout<<pairs[i-1]<<" "<<ans[i]<<endl;
    }
   // cout<<holdmin<<endl;
    
    
    for(int i=1;i<=n;i++){
         if(holdmin<=0){
         ans[i]+=abs(holdmin) + 1;
      }
        
    }
    /* for(int i=1;i<=n;i++){
        int maxi = arr[i];
        int mini = arr[i];
        for(int j=i+1;j<=n;j++){
            maxi = max(arr[j],maxi);
            mini = min(arr[j],mini);
            if(!check(i,j,mini,maxi)){
               // cout<<i<<" "<<j<<" "<<query(i,j)<<" "<<maxi-mini<<endl;
            }
        }
    }*/
 
    for(int i=1;i<=n;i++){
        answer(i,ans[i]);
    }
    
}
/*int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>arr[i];
    }
    solve(n);
}*/

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 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 328 KB Output is correct
8 Correct 4 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 3 ms 408 KB Output is correct
12 Correct 3 ms 404 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 ms 332 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 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 328 KB Output is correct
8 Correct 4 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 3 ms 408 KB Output is correct
12 Correct 3 ms 404 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 7 ms 248 KB Output is correct
17 Correct 11 ms 248 KB Output is correct
18 Correct 20 ms 376 KB Output is correct
19 Correct 22 ms 248 KB Output is correct
20 Correct 24 ms 376 KB Output is correct
21 Correct 27 ms 252 KB Output is correct
22 Correct 24 ms 248 KB Output is correct
23 Correct 13 ms 320 KB Output is correct
24 Correct 20 ms 376 KB Output is correct
25 Correct 27 ms 344 KB Output is correct
26 Correct 12 ms 324 KB Output is correct
27 Correct 23 ms 376 KB Output is correct
28 Correct 20 ms 404 KB Output is correct
29 Correct 18 ms 248 KB Output is correct
30 Correct 24 ms 504 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 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 328 KB Output is correct
8 Correct 4 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 3 ms 408 KB Output is correct
12 Correct 3 ms 404 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 7 ms 248 KB Output is correct
17 Correct 11 ms 248 KB Output is correct
18 Correct 20 ms 376 KB Output is correct
19 Correct 22 ms 248 KB Output is correct
20 Correct 24 ms 376 KB Output is correct
21 Correct 27 ms 252 KB Output is correct
22 Correct 24 ms 248 KB Output is correct
23 Correct 13 ms 320 KB Output is correct
24 Correct 20 ms 376 KB Output is correct
25 Correct 27 ms 344 KB Output is correct
26 Correct 12 ms 324 KB Output is correct
27 Correct 23 ms 376 KB Output is correct
28 Correct 20 ms 404 KB Output is correct
29 Correct 18 ms 248 KB Output is correct
30 Correct 24 ms 504 KB Output is correct
31 Correct 45 ms 376 KB Output is correct
32 Correct 57 ms 460 KB Output is correct
33 Correct 92 ms 376 KB Output is correct
34 Correct 106 ms 600 KB Output is correct
35 Correct 96 ms 376 KB Output is correct
36 Correct 102 ms 428 KB Output is correct
37 Correct 55 ms 452 KB Output is correct
38 Correct 110 ms 504 KB Output is correct
39 Correct 96 ms 700 KB Output is correct
40 Correct 103 ms 512 KB Output is correct
41 Correct 69 ms 424 KB Output is correct
42 Correct 103 ms 456 KB Output is correct
43 Correct 55 ms 372 KB Output is correct
44 Correct 94 ms 424 KB Output is correct
45 Correct 105 ms 376 KB Output is correct
46 Correct 106 ms 404 KB Output is correct
47 Correct 64 ms 448 KB Output is correct
48 Correct 104 ms 356 KB Output is correct
49 Correct 98 ms 604 KB Output is correct
50 Correct 102 ms 376 KB Output is correct
51 Correct 108 ms 536 KB Output is correct
52 Correct 100 ms 424 KB Output is correct
53 Correct 100 ms 364 KB Output is correct
54 Correct 98 ms 452 KB Output is correct
55 Correct 102 ms 548 KB Output is correct
56 Correct 98 ms 464 KB Output is correct
57 Correct 105 ms 468 KB Output is correct
58 Correct 105 ms 468 KB Output is correct
59 Correct 101 ms 584 KB Output is correct
60 Correct 109 ms 376 KB Output is correct