Submission #889383

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
8893832023-12-19 15:37:08PanndaTwo Currencies (JOI23_currencies)C++17
100 / 100
710 ms58696 KiB
#include <bits/stdc++.h>
using namespace std;
template<class T>
struct Fenwick {
int n;
vector<T> bit;
Fenwick(int n) : n(n), bit(n + 1, 0) {}
void add(int i, T delta) {
for (i++; i <= n; i += i & -i) {
bit[i] += delta;
}
}
void add(int l, int r, T delta) {
add(l, +delta);
add(r, -delta);
}
T get(int i) {
T res = 0;
for (i++; i > 0; i -= i & -i) {
res += bit[i];
}
return res;
}
};
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

currencies.cpp: In constructor 'Tree::Tree(int, std::vector<std::vector<int> >)':
currencies.cpp:39:25: warning: 'Tree::lift' will be initialized after [-Wreorder]
   39 |     vector<vector<int>> lift;
      |                         ^~~~
currencies.cpp:36:17: warning:   'std::vector<int> Tree::begin' [-Wreorder]
   36 |     vector<int> begin, end;
      |                 ^~~~~
currencies.cpp:41:5: warning:   when initialized here [-Wreorder]
   41 |     Tree(int n, vector<vector<int>> adj) : n(n), adj(adj), depth(n), lift(n, vector<int>(LOG, -1)), begin(n), end(n), tim(0) {
      |     ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...