# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1161655 | ace5 | Two Currencies (JOI23_currencies) | C++20 | 2 ms | 1096 KiB |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300005;
const int sqr = 317;
typedef long long ll;
ll decomp1[maxn];
ll arr1[maxn];
ll decomp2[maxn];
ll arr2[maxn];
int tin[maxn],tout[maxn];
int par[maxn];
int times = 0;
vector<int> eul;
vector<int> edg;
int c[maxn];
vector<vector<pair<int,int>>> g;
int L = 0,R = 0;
int ul = 0,ur = 0;
void modify(int i,int x)
{
//cout << "mod " << i << ' ' << x << endl;
arr1[i] += x;
decomp1[i/sqr] += x;
arr2[i] += (x > 0 ? 1 : (x < 0 ? -1 : 0));
decomp2[i/sqr] += (x > 0 ? 1 : (x < 0 ? -1 : 0));;
# | 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... |