제출 #888980

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
888980	2023-12-18 14:26:51	amirhoseinfar1385	Sprinkler (JOI22_sprinkler)	C++17	41 / 100	4054 ms	71184 KiB

sprinkler

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;
const long long maxn=200000+10;
vector<long long>adj[maxn];
long long q,high[maxn],n,mod,timea=0,part[maxn];
pair<long long,long long>stf[maxn];
struct segment{
  vector<long long>seg;
  long long sz=0;
  void create(){
    while(__builtin_popcount(sz)!=1){
      sz++;
    }
    seg.resize(sz*2,1);
  }
  void add(long long i,long long l,long long r,long long tl,long long tr,long long w){
    if(l>r||l>tr||r<tl||tl>tr){
      return ;
    }
    if(l>=tl&&r<=tr){
      seg[i]*=w;
      seg[i]%=mod;
      return ;
    }
    long long m=(l+r)>>1;
    add((i<<1),l,m,tl,tr,w);
    add((i<<1)^1,m+1,r,tl,tr,w);
    return ;
  }
  long long pors(long long i){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 3 / 3
• Subtask 2: 9 / 9
• Subtask 3: 29 / 29
• Subtask 4: 0 / 12
• Subtask 5: 0 / 30
• Subtask 6: 0 / 17