Submission #837589

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
837589	2023-08-25 12:31:52	Liudas	Rope (JOI17_rope)	C++17	80 / 100	2540 ms	171672 KiB

rope

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 tree[1048576 * 2] = {0};
int N = 1048576;
void update(int pos, int val){
  int head = N + pos;
  tree[head] += val;
  head /= 2;
  while(head){
    tree[head] = max(tree[head * 2 + 1], tree[head * 2]);
    head /= 2;
  }
}
int arr[1000050];
int main(){
  int N, M;
  cin >> N >> M;
  for(int i = 0; i < N; i ++){
    cin >> arr[i];
    arr[i]--;
  }
  vector<vector<vector<int>>> brr(M + 5, vector<vector<int>>(2));
  vector<int> counts(M + 5);
  for(int i = 0; i < N; i ++){
    for(int j = 0; j < 2; j ++){
      int pi = i + 1 - (i + j) % 2 * 2;
      if(pi > -1 && pi < N && arr[pi] != arr[i]){
        brr[arr[i]][j].push_back(arr[pi]);
      }
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 15 / 15
• Subtask 2: 30 / 30
• Subtask 3: 10 / 10
• Subtask 4: 25 / 25
• Subtask 5: 0 / 20