oj.uz

답안 #574703

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
574703 2022-06-09T09:33:49 Z SlavicG 비밀 (JOI14_secret) C++17
0 / 100
 477 ms 12224 KB 
#include "secret.h"
#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()

const int N = 1000;
int val[N][N], mm[N][N];
/*
int Secret(int l, int r) {
    return 69;
} 
*/

void build(int l, int r) {
    if(l >= r) return;
    int mid = l + r >> 1;

    for(int i = l + 1; i <= mid; ++i) {
        val[l][i] = Secret(val[l][i - 1], val[i][i]);
    }
    for(int i = mid + 2; i <= r; ++i) {
        val[mid + 1][i] = Secret(val[mid + 1][i - 1], val[i][i]);
    }

    for(int i = l; i <= mid; ++i) {
        for(int j = mid + 1; j <= r; ++j) {
            mm[i][j] = mid;
        }
    }

    build(l, mid);
    build(mid + 1, r);
}
void Init(int n, int a[]) {
    forn(i, N) forn(j, N) val[i][j] = -1;
    forn(i, n) val[i][i] = a[i];
    build(0, n - 1);
}

int Query(int l, int r) {
    if(val[l][r] != -1) return val[l][r];
    int mid = mm[l][r];
    return Secret(val[l][mid], val[mid + 1][r]);
}

/*
void solve() {  
    
}   
     
int32_t main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}
*/

Compilation message

secret.cpp: In function 'void build(int, int)':
secret.cpp:24:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   24 |     int mid = l + r >> 1;
      |               ~~^~~

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 115 ms 8348 KB Wrong Answer [1]
2 Incorrect 123 ms 8296 KB Wrong Answer [1]
3 Incorrect 139 ms 8352 KB Wrong Answer [1]
4 Incorrect 428 ms 12224 KB Wrong Answer [1]
5 Incorrect 458 ms 12188 KB Wrong Answer [1]
6 Incorrect 443 ms 12188 KB Wrong Answer [1]
7 Incorrect 438 ms 12192 KB Wrong Answer [1]
8 Incorrect 477 ms 12120 KB Wrong Answer [1]
9 Incorrect 452 ms 12080 KB Wrong Answer [1]
10 Incorrect 440 ms 12220 KB Wrong Answer [1]