oj.uz

답안 #956331

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
956331 2024-04-01T16:00:20 Z steveonalex Xylophone (JOI18_xylophone) C++17
0 / 100
 0 ms 344 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

// int query(int l, int r){
    
// }

// void answer(int i, int j){

// }

void solve(int n){
    vector<int> diff(n+1);
    for(int i= 1; i<n; ++i){
        diff[i] = query(i, i + 1);
    }
    vector<int> nigga(n+1);
    for(int i = 2; i<n; ++i){
        if (diff[i-1] + diff[i] < query(i-1, i+1)) nigga[i] = 1;
        nigga[i] ^= nigga[i-1];
    }
    for(int i= 2; i<n; ++i) if (nigga[i]) diff[i] *= -1;

    pair<int, int> ma = {1, 1};
    for(int i = 1; i<n; ++i){
        int sum = 0;
        for(int j = i; j<n; ++j){
            sum += diff[j];
            if (abs(sum) == n - 1) {
                ma = {i, j + 1};
            }
        }
    }

    for(int i = n; i>=2; --i) swap(diff[i], diff[i-1]);
    for(int i = 2; i<=n; ++i) diff[i] += diff[i-1];
    if (diff[ma.first] > 0 || diff[ma.second] < 0){
        for(int i = 1; i<=n; ++i) diff[i] *= -1;
    }

    vector<int> ans(n+1);
    for(int i= 1; i<=n; ++i) ans[i] = 1 - diff[ma.first];
    for(int i = 1; i<=n; ++i) answer(i, ans[i]);
}

// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);


//     return 0;
// }

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -