oj.uz

Submission #241516

# Submission time Handle Problem Language Result Execution time Memory
241516 2020-06-24T10:54:06 Z mhy908 Chessboard (IZhO18_chessboard) C++14
16 / 100
 54 ms 3832 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define svec(x) sort(x.begin(), x.end())
#define press(x) x.erase(unique(x.begin(), x.end()), x.end())
#define lb(x, v) lower_bound(x.begin(), x.end(), v)
#define ub(x, v) upper_bound(x.begin(), x.end(), v)
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
const LL llinf=2000000000000000000;
const LL mod1=1000000007;
const LL mod2=998244353;
const int inf=2000000000;
int n, k;
pair<pii, pii> rect[100010];
LL ans=llinf;
LL query2(int x, int y, int s){
    LL ret=0;
    int tx=x/s, ty=y/s;
    ret+=(LL)tx*ty/2*s*s;
    int rx=x%s, ry=y%s;
    if(tx%2)ret+=(LL)rx*(ty+1)/2*s;
    else ret+=(LL)rx*ty/2*s;
    if(ty%2)ret+=(LL)ry*(tx+1)/2*s;
    else ret+=(LL)ry*tx/2*s;
    if((tx+ty)%2)ret+=(LL)rx*ry;
    return ret;
}
pll query(int stx, int sty, int finx, int finy, int s){
    LL w=query2(finx, finy, s)-query2(stx-1, finy, s)-query2(finx, sty-1, s)+query2(stx-1, sty-1, s);
    LL b=(LL)(finx-stx+1)*(finy-sty+1)-w;
    return mp(b, w);
}
int main(){
    scanf("%d %d", &n, &k);
    for(int i=1; i<=k; i++){
        scanf("%d %d %d %d", &rect[i].F.F, &rect[i].F.S, &rect[i].S.F, &rect[i].S.S);
    }
    for(int i=1; i<n; i++){
        if(n%i)continue;
        LL w1=0, b1=0;
        for(int j=1; j<=k; j++){
            pll tmp=query(rect[j].F.F, rect[j].F.S, rect[j].S.F, rect[j].S.S, i);
            w1+=tmp.F;
            b1+=tmp.S;
        }
        LL temp1=w1+(LL)(n/i)*(n/i)/2*i*i-b1;
        LL temp2=b1+((LL)(n/i)*(n/i)+1)/2*i*i-w1;
        ans=min(ans, min(temp1, temp2));
    }
    printf("%lld", ans);
}
/*
6 8
3 3 3 3
1 2 1 2
3 4 3 4
5 5 5 5
4 3 4 3
4 4 4 4
2 1 2 1
3 6 3 6
*/

Compilation message

chessboard.cpp: In function 'int main()':
chessboard.cpp:42:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~~
chessboard.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d %d", &rect[i].F.F, &rect[i].F.S, &rect[i].S.F, &rect[i].S.S);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 256 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 2808 KB Output is correct
2 Correct 13 ms 1024 KB Output is correct
3 Correct 26 ms 2048 KB Output is correct
4 Correct 26 ms 1920 KB Output is correct
5 Correct 33 ms 2560 KB Output is correct
6 Correct 22 ms 1664 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 23 ms 1664 KB Output is correct
9 Correct 54 ms 3832 KB Output is correct
10 Correct 31 ms 2304 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 2808 KB Output is correct
2 Correct 13 ms 1024 KB Output is correct
3 Correct 26 ms 2048 KB Output is correct
4 Correct 26 ms 1920 KB Output is correct
5 Correct 33 ms 2560 KB Output is correct
6 Correct 22 ms 1664 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 23 ms 1664 KB Output is correct
9 Correct 54 ms 3832 KB Output is correct
10 Correct 31 ms 2304 KB Output is correct
11 Incorrect 5 ms 256 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 38 ms 2808 KB Output is correct
10 Correct 13 ms 1024 KB Output is correct
11 Correct 26 ms 2048 KB Output is correct
12 Correct 26 ms 1920 KB Output is correct
13 Correct 33 ms 2560 KB Output is correct
14 Correct 22 ms 1664 KB Output is correct
15 Correct 9 ms 640 KB Output is correct
16 Correct 23 ms 1664 KB Output is correct
17 Correct 54 ms 3832 KB Output is correct
18 Correct 31 ms 2304 KB Output is correct
19 Incorrect 5 ms 256 KB Output isn't correct
20 Halted 0 ms 0 KB -