# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47897 | dqhungdl | Chessboard (IZhO18_chessboard) | C++17 | 1161 ms | 49840 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>
using namespace std;
typedef pair<int,int> ii;
int n,k,odd,even;
int64_t res=1e12;
vector<ii> g1[100005],g2[100005];
int Cal(int u,int v,int block)
{
return ((u-1)/block+1+(v-1)/block+1)%2;
}
void Update(int i,int l,int r,int block,int val)
{
int ll=(l-1)/block+2;
int rr=(r-1)/block;
if(ll==rr+2)
{
if(Cal(i,l,block)==1)
odd+=(r-l+1)*val;
else
even+=(r-l+1)*val;
return;
}
odd+=(rr-ll+1)/2*block*val;
even+=(rr-ll+1)/2*block*val;
if((rr-ll+1)%2==1)
{
if(Cal(i,(ll-1)*block+1,block)==1)
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |