oj.uz

Submission #996204

# Submission time Handle Problem Language Result Execution time Memory
996204 2024-06-10T08:49:34 Z reginox Xylophone (JOI18_xylophone) C++17
0 / 100
 0 ms 344 KB 
#include<bits/stdc++.h>
#include "xylophone.h"
#define ll long long
#define all(v) begin(v), end(v)
#define pi pair<int, int>
#define vi vector<int>
using namespace std;
int a[5005], n;
int p1[5005], p2[5005];
 
bool thu(int u, int v){
    if(v < 1 || v > n) return false;
    a[1] = u, a[2] = v;
    for(int i = 3; i <= n; i++){
        if(a[i-2] > a[i-1]){
            if(p2[i]==max(p1[i],abs(a[i-2]-a[i-1]))){
                a[i] = a[i-1] + p1[i];
            }
            else if(p2[i]==p1[i]+abs(a[i-2]-a[i-1])){
               a[i] = a[i-1] - p1[i]; 
            }
            return false;
        }
        else{
            if(p2[i]==max(p1[i],abs(a[i-2]-a[i-1]))){
                a[i] = a[i-1] - p1[i];
            }
            else if(p2[i]==p1[i]+abs(a[i-2]-a[i-1])){
               a[i] = a[i-1] + p1[i]; 
            }
            else return false;
        }
    }
    vector<bool> ch(n, false);
    for(int i = 1; i <= n; i++){
        if(a[i] < 1 || a[i] > n) return false;
        if(ch[a[i]-1]) return false;
        ch[a[i]-1] = true;
    }
    return true;
}
 
void solve(int m){
    n = m;
    int d = query(1, 2);
    for(int i = 3; i <= n; i++){
        p1[i] = query(i-1, i), p2[i] = query(i-2, i);
    }
    for(int v1 = 1; v1 <= n; v1++){
        for(int z = -d; z <= d; z+=2*d){
            if(thu(v1, v1+z)){
                for(int i = 1; i <= n; i++) answer(i, a[i]);
                return ;
            }
        }
    }
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 344 KB Wrong Answer [6]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 344 KB Wrong Answer [6]
4 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 344 KB Wrong Answer [6]
4 Halted 0 ms 0 KB -