oj.uz

답안 #860888

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
860888 2023-10-14T18:05:32 Z vjudge1 Xylophone (JOI18_xylophone) C++17
0 / 100
 12 ms 98136 KB 
#include <bits/stdc++.h>
#include "xylophone.h"

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int dp[5001][5001];

int ask(int l, int r) {
    if(dp[l][r] != -1) return dp[l][r];
    return dp[l][r] = query(l, r);
}

void solve(int n) {
    memset(dp, -1, sizeof(dp));

    int l=1, r=n;
    int p1 = 0;

    while(l <= r) {
        int mid = (l + r) / 2;

        if(ask(mid, n) == n-1) {
            p1 = mid;
            l = mid + 1;
        } else r = mid - 1;
    }

    vector<int> ans(n+1, 0);
    ans[p1] = 1;

    if(p1 < n) ans[p1+1] = ans[p1] + ask(p1, p1+1);
    if(p1 > 1) ans[p1-1] = ans[p1] + ask(p1-1, p1);

    for(int i=p1-2; i>=1; i--) {
        int diff = ask(i, i+1);

        if(ans[i+1] + diff > n) {
            ans[i] = ans[i+1] - diff;
        } else if(ans[i+1] - diff < n) {
            ans[i] = ans[i+1] + diff;
        } else if(ans[i+2] > ans[i+1]) {
            if(ask(i, i+2) == ask(i, i+1) || ask(i, i+2) == ask(i+1, i+2))
                ans[i] = ans[i+1] + diff;
            else 
                ans[i] = ans[i+1] - diff;
        } else if(ans[i+2] < ans[i+1]) {
            if(ask(i, i+2) == ask(i, i+1) || ask(i, i+2) == ask(i+1, i+2))
                ans[i] = ans[i+1] - diff;
            else 
                ans[i] = ans[i+1] + diff;
        }
    }

    for(int i=p1+2; i<=n; i++) {
        int diff = ask(i, i-1);

        if(ans[i-1] + diff > n) {
            ans[i] = ans[i-1] - diff;
        } else if(ans[i-1] - diff < n) {
            ans[i] = ans[i-1] + diff;
        } else if(ans[i-2] > ans[i-1]) {
            if(ask(i, i-2) == ask(i, i-1) || ask(i, i-2) == ask(i-1, i-2))
                ans[i] = ans[i-1] + diff;
            else 
                ans[i] = ans[i-1] - diff;
        } else if(ans[i-2] < ans[i-1]) {
            if(ask(i, i-2) == ask(i, i-1) || ask(i, i-2) == ask(i-1, i-2))
                ans[i] = ans[i-1] - diff;
            else 
                ans[i] = ans[i-1] + diff;
        }
    }

    for(int i=1; i<=n; i++)
        answer(i, ans[i]);
}

// int32_t main() {
//     setIO();

//     //code starts here

//     return 0;
// }

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 98136 KB Output is correct
2 Incorrect 12 ms 98132 KB Wrong Answer [1]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 98136 KB Output is correct
2 Incorrect 12 ms 98132 KB Wrong Answer [1]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 98136 KB Output is correct
2 Incorrect 12 ms 98132 KB Wrong Answer [1]
3 Halted 0 ms 0 KB -