제출 #158470

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
158470	2019-10-17 09:10:37	maruii	조개 줍기 (KOI17_shell)	C++14	0 / 100	171 ms	20228 KiB

shell

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int N, f[1505][1505], A[1505][1505], ys[1505], ye[1505];
struct BIT {
  int A[1505];
  void update(int x, int v) {
    x++;
    for (; x; x -= x & -x) A[x] += v;
  }
  void update(int s, int e, int v) {
    update(e, v);
    update(s - 1, -v);
  }
  int query(int x) {
    x++;
    int ret = 0;
    for (; x < 1505; x += x & -x) ret += A[x];
    return ret;
  }
} fen[1505];
inline int query(int x, int y) { return f[x][y] + fen[x].query(y); }
void up(int x, int y, int c) {
  while (1) {
    int t = 0;
    if (c > 0) while (y + 1 <= N && query(x, y + 1) == query(x, y) + A[x][y + 1]) y++, t = 1;
    else while (y + 1 <= N && query(x, y + 1) != query(x - 1, y + 1) + A[x][y + 1]) y++, t = 1;
    ye[x] = y;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 12
• Subtask 2: 0 / 34
• Subtask 3: 0 / 54