oj.uz

답안 #553281

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
553281 2022-04-25T10:48:01 Z cadmiumsky 비밀 (JOI14_secret) C++14
0 / 100
 490 ms 4504 KB 
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e3 + 5;

vector<int> v;

namespace RMQ {
  int atr[nmax];
  int rmq[12][nmax];
  void color(int l, int r, int bit = 0) {
    //cerr << l << ' ' << r << ' ' << bit << '\n';
    if(l + 1 >= r) {
      while(l <= r)
        atr[l] = bit, l++;
      return;
    }
    int mid = l + r >> 1;
    atr[mid] = -bit;
    atr[mid + 1] = bit;
    color(l, mid - 1, bit + 1);
    color(mid + 2, r, bit + 1);
    rmq[bit][mid] = v[mid];
    rmq[bit][mid + 1] = v[mid + 1];
    for(int i = mid - 1; i >= l; i--)
      rmq[bit][i] = Secret(v[i], rmq[bit][i + 1]);
    for(int i = mid + 2; i <= r; i++)
      rmq[bit][i] = Secret(rmq[bit][i - 1], v[i]);
    return;
  }
  namespace IRMQ {
    pair<int,int> irmq[12][nmax];
    int lg[nmax];
    void init(int n, int *vec) {
      lg[1] = 0;
      for(int i = 2; i <= n; i++)
        lg[i] = lg[i >> 1] + 1;
      for(int i = 0; i < n; i++)
        irmq[0][i] = {abs(vec[i]), vec[i] / abs(vec[i]) * i};
      for(int bit = 1; bit < 12; bit++) {
        for(int i = 0; i + (1 << bit) <= n; i++)
          irmq[bit][i] = min(irmq[bit - 1][i], irmq[bit - 1][i + (1 << bit - 1)]);
      }
    }
    pair<int,int> query(int l, int r) {
      int st = lg[r - l + 1];
      return min(irmq[st][l], irmq[st][r - (1 << st) + 1]);
    } 
  }
  int query(int l, int r) {
    if(l == r) 
      return v[l];
    else if(l == r - 1)
      return Secret(v[l], v[r]);
    auto level = IRMQ::query(l, r);
    if(r == -level.second)
      return rmq[level.first][l];
    if(l == level.second)
      return rmq[level.first][r];
    
    return Secret(rmq[level.first][l], rmq[level.first][r]);
  }
}


void Init(int N, int A[]) {
  v.resize(N);
  for(int i = 0; i < N; i++)
    v[i] = A[i];
  RMQ::color(0, N - 1);
  RMQ::IRMQ::init(N, RMQ::atr);
}

int Query(int L, int R) {
  return RMQ::query(L, R);
}

Compilation message

secret.cpp: In function 'void RMQ::color(int, int, int)':
secret.cpp:18:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   18 |     int mid = l + r >> 1;
      |               ~~^~~
secret.cpp: In function 'void RMQ::IRMQ::init(int, int*)':
secret.cpp:42:76: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   42 |           irmq[bit][i] = min(irmq[bit - 1][i], irmq[bit - 1][i + (1 << bit - 1)]);
      |                                                                        ~~~~^~~

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 114 ms 2508 KB Wrong Answer: Query(25, 255) - expected : 538271930, actual : 826559203.
2 Incorrect 120 ms 2440 KB Wrong Answer: Query(255, 401) - expected : 425334856, actual : 470290464.
3 Incorrect 128 ms 2432 KB Wrong Answer: Query(30, 256) - expected : 562354372, actual : 763861176.
4 Incorrect 440 ms 4412 KB Wrong Answer: Query(499, 671) - expected : 42189446, actual : 546554048.
5 Incorrect 490 ms 4300 KB Wrong Answer: Query(323, 499) - expected : 244860236, actual : 408602960.
6 Incorrect 457 ms 4280 KB Wrong Answer: Query(494, 499) - expected : 55889249, actual : 710798704.
7 Correct 458 ms 4404 KB Output is correct - number of calls to Secret by Init = 6996, maximum number of calls to Secret by Query = 1
8 Correct 432 ms 4400 KB Output is correct - number of calls to Secret by Init = 6996, maximum number of calls to Secret by Query = 1
9 Correct 457 ms 4400 KB Output is correct - number of calls to Secret by Init = 6996, maximum number of calls to Secret by Query = 1
10 Correct 452 ms 4504 KB Output is correct - number of calls to Secret by Init = 6996, maximum number of calls to Secret by Query = 1