# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90102 | Abelyan | Chessboard (IZhO18_chessboard) | C++17 | 473 ms | 68544 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 long long ll;
const int N=100005;
int l1[N],l2[N],r1[N],r2[N];
ll prsp[N],prsv[N];
int main(){
ll n;
int k;
cin>>n>>k;
for (int i=0;i<k;i++){
cin>>l1[i]>>l2[i]>>r1[i]>>r2[i];
}
ll mn=LLONG_MAX;
for (ll i=1;i<n;i++){
if (n%i)continue;
ll qan;
if ((n/i)%2) qan=(n*n-i*i)/2ll;
else qan=(n*n)/2;
prsp[0]=prsv[0]=0;
//cout<<i<<" "<<qan<<endl;
for (ll j=1;j<=n;j++){
prsp[j]=prsp[j-1];
prsv[j]=prsv[j-1];
if (((j-1ll)/i)%2){
prsv[j]++;
}
else{
prsp[j]++;
# | 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... |