# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
690507 | Kaztaev_Alisher | Trading (IZhO13_trading) | C++17 | 1 ms | 340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
using namespace std;
using ll = long long;
const ll N = 505 , M = 1005 , inf = 2e9 + 7;
const ll INF = 1e18 , mod = 1e9+7 , P = 6547;
ll n , q;
vector<pair<ll,ll>> v[N];
ll t[N*4] , u[N*4];
void push(ll v , ll tl , ll tr){
if(tl == tr || u[v] == 0) return;
t[v*2] += u[v];
t[v*2+1] += u[v];
u[v*2] += u[v];
u[v*2+1] += u[v];
u[v] = 0;
}
void upd(ll v , ll tl , ll tr , ll pos , ll val){
push(v,tl,tr);
if(tl == tr){
t[v] = val;
return;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |