제출 #697518

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
697518	2023-02-10 08:02:40	Sandarach151	Crossing (JOI21_crossing)	C++17	100 / 100	1930 ms	31384 KiB

Main

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;
struct segtree{
  vector<char> curequals;
  vector<char> targequals;
  vector<bool> equals;
  string cur;
  string targ;
  int size;
  segtree(int _size, string _cur, string _targ): cur(_cur), targ(_targ), size(_size){
        curequals.resize(4*size+5);
        targequals.resize(4*size+5);
        equals.resize(4*size+5);
        build(0, size-1, 0);
    }
    void build(int left, int right, int pos){
        if(left!=right){
            int mid = (left+right)/2;
            build(left, mid, 2*pos+1);
            build(mid+1, right, 2*pos+2);
            if(targequals[2*pos+1]==targequals[2*pos+2]){
                targequals[pos]=targequals[2*pos+1];
            }
            else{
                targequals[pos]='0';
            }
            if(curequals[2*pos+1]==curequals[2*pos+2]){
                curequals[pos]=curequals[2*pos+1];
            }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 3 / 3
• Subtask 2: 23 / 23
• Subtask 3: 23 / 23
• Subtask 4: 51 / 51