oj.uz

답안 #361886

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
361886 2021-01-31T20:56:35 Z Lemur95 비밀 (JOI14_secret) C++17
0 / 100
 515 ms 8368 KB 
#include <bits/stdc++.h>
#include "secret.h"
#pragma GCC optimize("Ofast")
#define x first
#define y second
#define ld long double
#define ll long long
#define ull unsigned long long
#define us unsigned short
#define lsb(x) ((x) & (-(x)))

using namespace std;

int n;

int v[1005], sum[1005][1005];

/*int Secret(int x, int y) {
  return x + y;
}*/

void divide(int st, int dr) {
  if(st == dr) {
    sum[st][st] = v[st];
    return;
  }
  int mid = (st + dr) >> 1;
  //sum[mid][mid] = v[mid];
  for(int i = mid - 1; i >= st; i--)
    sum[i][mid] = Secret(sum[i + 1][mid], v[i]);
  if(mid < n - 1)
    sum[mid + 1][mid + 1] = v[mid + 1];
  for(int i = mid + 2; i <= dr; i++)
    sum[mid + 1][i] = Secret(sum[mid + 1][i - 1], v[i]);
  divide(st, mid);
  divide(mid + 1, dr);
}

void Init(int N, int a[]) {
  n = N;
  for(int i = 0; i < n; i++)
    v[i] = a[i], sum[i][i] = a[i];
  divide(0, n - 1);
}

int solve(int st, int dr, int l, int r) {
  int mid = (st + dr) >> 1;
  if(l <= mid && mid <= r) {
    if(l == mid || mid == r)
      return sum[l][r];
    else
      return Secret(sum[l][mid], sum[mid + 1][r]);
  }
  if(r < mid)
    return solve(st, mid, l, r);
  return solve(mid + 1, dr, l, r);
}

int Query(int l, int r) {
  if(l == r)
    return v[l];
  return solve(0, n - 1, l, r);
}

/*int main() {
  ios_base :: sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, Q, l, r, a[10005];
  cin >> n;
  for(int i = 0; i < n; i++)
    cin >> a[i];
  Init(n, a);
  cin >> Q;
  for(; Q; Q--) {
    cin >> l >> r;
    cout << Query(l, r) << "\n";
    int s = v[l];
    for(int i = l + 1; i <= r; i++)
      s = Secret(s, v[i]);
    cout << s << " right answer\n";
  }
  return 0;
}*/

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 132 ms 4588 KB Wrong Answer: Query(113, 206) - expected : 536899947, actual : 538256673.
2 Incorrect 133 ms 4460 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 134 ms 4480 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 515 ms 8184 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 506 ms 8324 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316.
6 Incorrect 504 ms 8228 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 0.
7 Incorrect 502 ms 8300 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873.
8 Incorrect 496 ms 8236 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792.
9 Incorrect 497 ms 8300 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577.
10 Incorrect 501 ms 8368 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787.