oj.uz

답안 #930106

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930106 2024-02-18T14:03:04 Z OAleksa 말 (IOI15_horses) C++14
17 / 100
 324 ms 53604 KB 
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int inf = 1e18 + 69;
const int N = 5e5 + 69;
int n, a[N], b[N], c[N], p[4 * N], g[4 * N];
set<int> pr, sf;
int mul(int x, int y) {
   long long r = 1ll * x * y;
   if (r >= mod)
      r %= mod;
   return r;
}

void modify(int v, int tl, int tr, int pos, int x) {
   if (tl == tr)
      p[v] = g[v] = x;
   else {
      int mid = (tl + tr) / 2;
      if (pos <= mid)
         modify(v * 2, tl, mid, pos, x);
      else
         modify(v * 2 + 1, mid + 1, tr, pos, x);
      if (p[v * 2] == -1 || p[v * 2 + 1] == -1 || p[v * 2] > inf / p[v * 2 + 1])
         p[v] = -1;
      else
         p[v] = p[v * 2] * p[v * 2 + 1];
      g[v] = mul(g[v * 2], g[v * 2 + 1]);
   }
}

int get(int v, int tl, int tr, int l, int r) {
   if (tl > r || tr < l)
      return 1;
   else if (tl >= l && tr <= r)
      return p[v];
   else {
      int mid = (tl + tr) / 2;
      auto l1 = get(v * 2, tl, mid, l, r);
      auto r1 = get(v * 2 + 1, mid + 1, tr, l, r);
      if (l1 == -1 || r1 == -1 || l1 > inf / r1)
         return -1;
      return l1 * r1;
   }
}
int Get(int v, int tl, int tr, int l, int r) {
   if (tl > r || tr < l)
      return 1;
   else if (tl >= l && tr <= r)
      return g[v];
   else {
      int mid = (tl + tr) / 2;
      return mul(Get(v * 2, tl, mid, l, r), Get(v * 2 + 1, mid + 1, tr, l, r));
   }
}
int Better(int i, int j) {
   if (i > j)
      swap(i, j);
   int x = get(1, 1, n, i + 1, j);
   if (x < 0 || x > inf / b[j])
      return j;
   return (b[i] > b[j] * x ? i : j);
}
int Result(int i) {
   return mul(Get(1, 1, n, 1, i), b[i]);
}

int init(int N, int X[], int Y[]) {
   n = N;
   for (int i = 0;i < 4 * N;i++) {
      p[i] = g[i] = 1;
   }
   for (int i = 1;i <= n;i++) {
      a[i] = X[i - 1], b[i] = Y[i - 1];
      modify(1, 1, n, i, a[i]);
   }
   int bst = 1, x = a[1];
   pr.insert(1);
   for (int i = 2;i <= n;i++) {
      if (x > inf / a[i]) {
         x = 1;
         bst = i;
      }
      else {
         x *= a[i];
         if (b[i] > b[bst] / x) {
            x = 1;
            bst = i;
         }
      }
      if (bst == i)
         pr.insert(i);
   }
   bst = n, x = a[n];
   sf.insert(n);
   for (int i = n - 1;i >= 1;i--) {
      if (x > inf / a[i]) {
         x = a[i];
         bst = i;
      }
      else {
         if (b[bst] < b[i] / x) {
            x = a[i];
            bst = i;
         }
         else
            x *= a[i];
      }
      if (bst == i)
         sf.insert(i);
   }
   return Result(bst);
}

int updateX(int pos, int val) {
   pos++;
   a[pos] = val;
   modify(1, 1, n, pos, a[pos]);
   int bst = -1;
   auto desno = sf.upper_bound(pos);
   auto levo  = pr.lower_bound(pos);
   auto t = levo;
   if (levo != pr.begin()) {
      --t;
      bst = Better(*t, pos);
      if (bst == *t && pr.count(pos))
         pr.erase(pos);
      else if (bst == pos)
         pr.insert(pos);
   }
   else
      bst = pos;
   if (desno != sf.end()) {
      bst = Better(bst, *desno);
      int x = Better(pos, *desno);
      if (x == *desno && sf.count(pos))
         sf.erase(pos);
      else if (x == pos)
         sf.insert(pos);
   }
   assert(bst != -1);
   sf.insert(bst);
   pr.insert(bst);
   auto u = sf.lower_bound(bst);
   while (u != sf.begin()) {
      sf.erase(*--u);
      u = sf.lower_bound(bst);
   }
   u = pr.upper_bound(bst);
   while (u != pr.end()) {
      pr.erase(*u);
      u = pr.upper_bound(bst);
   }
	return Result(bst);
}

int updateY(int pos, int val) {
   pos++;
	b[pos] = val;
   int bst = -1;
   auto desno = sf.upper_bound(pos);
   auto levo  = pr.lower_bound(pos);
   auto t = levo;
   if (levo != pr.begin()) {
      --t;
      bst = Better(*t, pos);
      if (bst == *t && pr.count(pos))
         pr.erase(pos);
      else if (bst == pos)
         pr.insert(pos);
   }
   else
      bst = pos;
   if (desno != sf.end()) {
      bst = Better(bst, *desno);
      int x = Better(pos, *desno);
      if (x == *desno && sf.count(pos))
         sf.erase(pos);
      else if (x == pos)
         sf.insert(pos);
   }
   assert(bst != -1);
   sf.insert(bst);
   pr.insert(bst);
   auto u = sf.lower_bound(bst);
   while (u != sf.begin()) {
      sf.erase(*--u);
      u = sf.lower_bound(bst);
   }
   u = pr.upper_bound(bst);
   while (u != pr.end()) {
      pr.erase(*u);
      u = pr.upper_bound(bst);
   }
	return Result(bst);
}
/*
3
2 1 3
3 4 1
1
2 1 2
*/

Compilation message

horses.cpp:5:22: warning: overflow in conversion from 'double' to 'int' changes value from '1.0000000000000001e+18' to '2147483647' [-Woverflow]
    5 | const int inf = 1e18 + 69;
      |                 ~~~~~^~~~
horses.cpp: In function 'int mul(int, int)':
horses.cpp:13:11: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   13 |    return r;
      |           ^
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:69:14: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   69 | int init(int N, int X[], int Y[]) {
      |          ~~~~^
horses.cpp:6:11: note: shadowed declaration is here
    6 | const int N = 5e5 + 69;
      |           ^

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6584 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6744 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6488 KB Output is correct
17 Correct 1 ms 6648 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6744 KB Output is correct
23 Incorrect 2 ms 6488 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 324 ms 53604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6592 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6584 KB Output is correct
15 Correct 1 ms 6592 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Incorrect 2 ms 6492 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6600 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Incorrect 2 ms 6492 KB Output isn't correct
24 Halted 0 ms 0 KB -