# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1150072 | vladilius | Boat (APIO16_boat) | C++20 | 2100 ms | 406268 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
const int mod = 1e9 + 7;
struct FT{
vector<int> bit, a;
int n;
FT(int ns){
n = ns;
bit.resize(n + 1);
a.resize(n + 1);
}
int get(int v){
int out = 0;
while (v > 0){
out = (out + bit[v]) % mod;
v = (v & (v + 1)) - 1;
}
return out;
}
void upd(int v, int x){
x %= mod;
int X = (x - a[v]) % mod;
if (X < 0) X += mod;
a[v] = x;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |