oj.uz

답안 #1101146

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101146 2024-10-15T16:31:25 Z InvMOD 비밀 (JOI14_secret) C++14
100 / 100
 331 ms 8392 KB 
#include<bits/stdc++.h>
#include "secret.h"
 
using namespace std;
 
const int N = 1e3+1;
 
int mx_size, pref[N][N];

/*
int Secret(int x, int y){
    return min(x + ((y>>1)<<1), (int)1e9);
}
*/
 
void Dnc(int l, int r, vector<int>& v){
    if(l == r){
        pref[l][l] = v[l];
        return;
    }
 
    int m = l+r>>1;
    pref[m][m] = v[m];
    pref[m+1][m+1] = v[m+1];
 
    for(int i = m-1; i >= l; i--){
        pref[i][m] = Secret(v[i], pref[i+1][m]);
    }
    for(int i = m+2; i <= r; i++){
        pref[m+1][i] = Secret(pref[m+1][i-1], v[i]);
    }
 
    Dnc(l, m, v);
    Dnc(m+1, r, v);
    return;
}
 
void Init(int n, int a[]){
    vector<int> v;
    for(int i = 0; i < n; i++){
        v.push_back(a[i]);
    }
 
    --n; mx_size = n;
    Dnc(0, n, v);
    return;
}
 
int get(int l, int r, int Ql, int Qr){
    if(l == r){
        return pref[l][r];
    }
    else{
        int m = l+r>>1;
        if(Ql <= m && Qr > m){
            return Secret(pref[Ql][m], pref[m+1][Qr]);
        }
        else{
            if(Qr <= m){
                return get(l, m, Ql, Qr);
            }
            else{
                return get(m+1, r, Ql, Qr);
            }
        }
    }
    return -1;
}
 
int Query(int l, int r){
    return get(0, mx_size, l, r);
}

Compilation message

secret.cpp: In function 'void Dnc(int, int, std::vector<int>&)':
secret.cpp:22:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |     int m = l+r>>1;
      |             ~^~
secret.cpp: In function 'int get(int, int, int, int)':
secret.cpp:54:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   54 |         int m = l+r>>1;
      |                 ~^~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 6728 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 85 ms 6736 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 84 ms 6844 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 306 ms 8392 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 305 ms 8264 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 313 ms 8380 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 308 ms 8380 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 331 ms 8192 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 317 ms 8264 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 306 ms 8264 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1