Submission #303979

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
303979	2020-09-20 22:31:46	myungwoo	Comparing Plants (IOI20_plants)	C++17	44 / 100	1652 ms	21448 KiB

plants

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>
#include "plants.h"
using namespace std;
#define MAXN 200005
#define debug(...) fprintf(stderr, __VA_ARGS__); fflush(stderr);
const int TS = 1<<19, ST = TS/2-1;
int N, K, R[MAXN];
int A[MAXN], B[MAXN];
template <typename T>
struct SegTree{
  struct Value{
    T value, lazysum;
  };
  vector<Value> tree;
  SegTree(int arr[]){
    tree.resize(TS, {0, 0});
    for (int i=ST+1;i<TS;i++) tree[i].value = i-ST <= N ? arr[i-ST] : 1e9;
    for (int i=ST;i;i--) tree[i].value = min(tree[i*2].value, tree[i*2+1].value);
  }
  void propagate(int n){
    if (n <= ST){
      tree[n*2].value += tree[n].lazysum, tree[n*2+1].value += tree[n].lazysum;
      tree[n*2].lazysum += tree[n].lazysum, tree[n*2+1].lazysum += tree[n].lazysum;
    }
    tree[n].lazysum = 0;
  }
  void update(int n, int s, int e, int l, int r, const int &v){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:6:20: warning: macro expands to multiple statements [-Wmultistatement-macros]
    6 | #define debug(...) fprintf(stderr, __VA_ARGS__); fflush(stderr);
      |                    ^~~~~~~
plants.cpp:107:25: note: in expansion of macro 'debug'
  107 |  for (int i=1;i<=N;i++) debug("%d ", A[i]); debug("\n");
      |                         ^~~~~
plants.cpp:107:2: note: some parts of macro expansion are not guarded by this 'for' clause
  107 |  for (int i=1;i<=N;i++) debug("%d ", A[i]); debug("\n");
      |  ^~~
plants.cpp:6:20: warning: macro expands to multiple statements [-Wmultistatement-macros]
    6 | #define debug(...) fprintf(stderr, __VA_ARGS__); fflush(stderr);
      |                    ^~~~~~~
plants.cpp:110:25: note: in expansion of macro 'debug'
  110 |  for (int i=1;i<=N;i++) debug("%d ", B[i]); debug("\n");
      |                         ^~~~~
plants.cpp:110:2: note: some parts of macro expansion are not guarded by this 'for' clause
  110 |  for (int i=1;i<=N;i++) debug("%d ", B[i]); debug("\n");
      |  ^~~
plants.cpp: In instantiation of 'void SegTree<T>::update(int, int, int, int, int, const int&) [with T = int]':
plants.cpp:92:40:   required from here
plants.cpp:37:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   37 |   int m = s+e >> 1;
      |           ~^~

• Subtask 1: 0 / 5
• Subtask 2: 14 / 14
• Subtask 3: 13 / 13
• Subtask 4: 17 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 15
• Subtask 7: 0 / 25