Submission #604408

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
604408	2022-07-25 05:59:48	amunduzbaev	Werewolf (IOI18_werewolf)	C++17	34 / 100	431 ms	524288 KiB

werewolf

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 "werewolf.h"
#include "bits/stdc++.h"
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif
#define ar array
typedef long long ll;
const int N = 2e5 + 5;
vector<int> edges[N];
int c[N];
struct ST{
  int mn[N << 2], mx[N << 2];
  void set(int i, int v, int lx = 0, int rx = N, int x = 1){
    if(lx == rx) { mn[x] = mx[x] = v; return; }
    int m = (lx + rx) >> 1;
    if(i <= m) set(i, v, lx, m, x << 1);
    else set(i, v, m + 1, rx, x << 1 | 1);
    mn[x] = min(mn[x << 1], mn[x << 1 | 1]);
    mx[x] = max(mx[x << 1], mx[x << 1 | 1]);
  }
  
  int get_f(int l, int r, int v, int lx = 0, int rx = N, int x = 1){
    if(lx > r || rx < l) return -1;
    if(lx >= l && rx <= r){
      if(mn[x] >= v) return -1;
      if(lx == rx) return lx;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 7
• Subtask 2: 0 / 8
• Subtask 3: 34 / 34
• Subtask 4: 0 / 51