oj.uz

Submission #378584

# Submission time Handle Problem Language Result Execution time Memory
378584 2021-03-17T01:59:15 Z i_am_noob Chessboard (IZhO18_chessboard) C++17
100 / 100
 1548 ms 4036 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long
#define rep(n) rep1(i,n)
#define rep1(i,n) rep2(i,0,n)
#define rep2(i,a,b) for(int i=a; i<b; ++i)
#define rep3(i,a,b) for(int i=a; i>=b; --i)
#define sz(a) ((int)a.size())
#define all(a) a.begin(),a.end()
#define pow2(x) (1ll<<(x))

#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x){cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&... y){cerr << x << ' ',_do(y...);}
#else
#define bug(...) 826
#endif

const int maxn=100005;
const int mod=1000000007;
#define y1 hhhhaura_TOI_2J

int n,k,x1[maxn],x2[maxn],y1[maxn],y2[maxn],area,ans=1e18;

inline int calc(int t, int x, int y){
    if(x<0||y<0) return 0;
    int a=x/t,b=y/t,res=(x/t)*(y/t)/2*t*t;
    int c=a&1?(b+1)/2*t:b/2*t;
    c+=y%t+1;
    int d=b&1?(a+1)/2*t:a/2*t;
    d+=x%t+1;
    if(x==2&&y==2) bug(c,d);
    if((a+b)&1) return res+c*d-(c-y%t-1)*(d-x%t-1);
    return res+c*d-(c-y%t-1)*(d-x%t-1)-(x%t+1)*(y%t+1);
}

inline int calc1(int t, int id){
    return calc(t,x2[id],y2[id])-calc(t,x1[id]-1,y2[id])-calc(t,x2[id],y1[id]-1)+calc(t,x1[id]-1,y1[id]-1);
}

inline int calc2(int t, int id){
    return (x2[id]-x1[id]+1)*(y2[id]-y1[id]+1)-calc1(t,id);
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    #ifdef i_am_noob
    freopen("input1.txt","r",stdin);
    freopen("output1.txt","w",stdout);
    freopen("output2.txt","w",stderr);
    #endif
    cin >> n >> k;
    rep(k) cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];
    rep(k) x1[i]--,y1[i]--,x2[i]--,y2[i]--;
    rep(k) area+=(x2[i]-x1[i]+1)*(y2[i]-y1[i]+1);
    rep(5) rep1(j,5){
        int tmp=calc(2,i,j);
        bug(i,j,tmp);
    }
    rep2(i,1,n) if(n%i==0){
        int val=0;
        rep1(j,k) val+=calc1(i,j);
        //area-val good
        //cnt(black)-(area-val)
        bug(val);
        val+=((n/i)&1?((n/i)*(n/i)+1)/2*i*i:(n/i)*(n/i)/2*i*i)-area+val;
        ans=min(ans,val);
        bug(val);
        val=0;
        rep1(j,k) val+=calc2(i,j);
        bug(val);
        val+=(n/i)*(n/i)/2*i*i-area+val;
        ans=min(ans,val);
        bug(val);
    }
    cout << ans << "\n";
}

Compilation message

chessboard.cpp: In function 'long long int calc(long long int, long long int, long long int)':
chessboard.cpp:18:18: warning: statement has no effect [-Wunused-value]
   18 | #define bug(...) 826
      |                  ^~~
chessboard.cpp:34:20: note: in expansion of macro 'bug'
   34 |     if(x==2&&y==2) bug(c,d);
      |                    ^~~
chessboard.cpp: In function 'int main()':
chessboard.cpp:18:18: warning: statement has no effect [-Wunused-value]
   18 | #define bug(...) 826
      |                  ^~~
chessboard.cpp:60:9: note: in expansion of macro 'bug'
   60 |         bug(i,j,tmp);
      |         ^~~
chessboard.cpp:59:13: warning: unused variable 'tmp' [-Wunused-variable]
   59 |         int tmp=calc(2,i,j);
      |             ^~~
chessboard.cpp:18:18: warning: statement has no effect [-Wunused-value]
   18 | #define bug(...) 826
      |                  ^~~
chessboard.cpp:67:9: note: in expansion of macro 'bug'
   67 |         bug(val);
      |         ^~~
chessboard.cpp:18:18: warning: statement has no effect [-Wunused-value]
   18 | #define bug(...) 826
      |                  ^~~
chessboard.cpp:70:9: note: in expansion of macro 'bug'
   70 |         bug(val);
      |         ^~~
chessboard.cpp:18:18: warning: statement has no effect [-Wunused-value]
   18 | #define bug(...) 826
      |                  ^~~
chessboard.cpp:73:9: note: in expansion of macro 'bug'
   73 |         bug(val);
      |         ^~~
chessboard.cpp:18:18: warning: statement has no effect [-Wunused-value]
   18 | #define bug(...) 826
      |                  ^~~
chessboard.cpp:76:9: note: in expansion of macro 'bug'
   76 |         bug(val);
      |         ^~~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2284 KB Output is correct
2 Correct 9 ms 876 KB Output is correct
3 Correct 23 ms 1644 KB Output is correct
4 Correct 22 ms 1772 KB Output is correct
5 Correct 29 ms 2028 KB Output is correct
6 Correct 18 ms 1388 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 18 ms 1388 KB Output is correct
9 Correct 46 ms 3180 KB Output is correct
10 Correct 30 ms 2156 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 380 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 380 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 18 ms 1260 KB Output is correct
17 Correct 36 ms 2924 KB Output is correct
18 Correct 65 ms 3564 KB Output is correct
19 Correct 288 ms 3180 KB Output is correct
20 Correct 330 ms 3436 KB Output is correct
21 Correct 44 ms 2924 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 47 ms 1744 KB Output is correct
24 Correct 72 ms 3128 KB Output is correct
25 Correct 10 ms 620 KB Output is correct
26 Correct 37 ms 2156 KB Output is correct
27 Correct 60 ms 2540 KB Output is correct
28 Correct 63 ms 3308 KB Output is correct
29 Correct 17 ms 1388 KB Output is correct
30 Correct 2 ms 492 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2284 KB Output is correct
2 Correct 9 ms 876 KB Output is correct
3 Correct 23 ms 1644 KB Output is correct
4 Correct 22 ms 1772 KB Output is correct
5 Correct 29 ms 2028 KB Output is correct
6 Correct 18 ms 1388 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 18 ms 1388 KB Output is correct
9 Correct 46 ms 3180 KB Output is correct
10 Correct 30 ms 2156 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 380 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 18 ms 1260 KB Output is correct
27 Correct 36 ms 2924 KB Output is correct
28 Correct 65 ms 3564 KB Output is correct
29 Correct 288 ms 3180 KB Output is correct
30 Correct 330 ms 3436 KB Output is correct
31 Correct 44 ms 2924 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 47 ms 1744 KB Output is correct
34 Correct 72 ms 3128 KB Output is correct
35 Correct 10 ms 620 KB Output is correct
36 Correct 37 ms 2156 KB Output is correct
37 Correct 60 ms 2540 KB Output is correct
38 Correct 63 ms 3308 KB Output is correct
39 Correct 17 ms 1388 KB Output is correct
40 Correct 2 ms 492 KB Output is correct
41 Correct 254 ms 2924 KB Output is correct
42 Correct 88 ms 3308 KB Output is correct
43 Correct 143 ms 3016 KB Output is correct
44 Correct 73 ms 3180 KB Output is correct
45 Correct 51 ms 3436 KB Output is correct
46 Correct 314 ms 3308 KB Output is correct
47 Correct 45 ms 3052 KB Output is correct
48 Correct 120 ms 3136 KB Output is correct
49 Correct 67 ms 3052 KB Output is correct
50 Correct 1390 ms 3308 KB Output is correct
51 Correct 1473 ms 3440 KB Output is correct
52 Correct 1367 ms 3232 KB Output is correct
53 Correct 1470 ms 3424 KB Output is correct
54 Correct 1365 ms 3308 KB Output is correct
55 Correct 1518 ms 3564 KB Output is correct
56 Correct 1323 ms 3180 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 32 ms 2284 KB Output is correct
10 Correct 9 ms 876 KB Output is correct
11 Correct 23 ms 1644 KB Output is correct
12 Correct 22 ms 1772 KB Output is correct
13 Correct 29 ms 2028 KB Output is correct
14 Correct 18 ms 1388 KB Output is correct
15 Correct 4 ms 620 KB Output is correct
16 Correct 18 ms 1388 KB Output is correct
17 Correct 46 ms 3180 KB Output is correct
18 Correct 30 ms 2156 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 380 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 18 ms 1260 KB Output is correct
35 Correct 36 ms 2924 KB Output is correct
36 Correct 65 ms 3564 KB Output is correct
37 Correct 288 ms 3180 KB Output is correct
38 Correct 330 ms 3436 KB Output is correct
39 Correct 44 ms 2924 KB Output is correct
40 Correct 2 ms 364 KB Output is correct
41 Correct 47 ms 1744 KB Output is correct
42 Correct 72 ms 3128 KB Output is correct
43 Correct 10 ms 620 KB Output is correct
44 Correct 37 ms 2156 KB Output is correct
45 Correct 60 ms 2540 KB Output is correct
46 Correct 63 ms 3308 KB Output is correct
47 Correct 17 ms 1388 KB Output is correct
48 Correct 2 ms 492 KB Output is correct
49 Correct 254 ms 2924 KB Output is correct
50 Correct 88 ms 3308 KB Output is correct
51 Correct 143 ms 3016 KB Output is correct
52 Correct 73 ms 3180 KB Output is correct
53 Correct 51 ms 3436 KB Output is correct
54 Correct 314 ms 3308 KB Output is correct
55 Correct 45 ms 3052 KB Output is correct
56 Correct 120 ms 3136 KB Output is correct
57 Correct 67 ms 3052 KB Output is correct
58 Correct 1390 ms 3308 KB Output is correct
59 Correct 1473 ms 3440 KB Output is correct
60 Correct 1367 ms 3232 KB Output is correct
61 Correct 1470 ms 3424 KB Output is correct
62 Correct 1365 ms 3308 KB Output is correct
63 Correct 1518 ms 3564 KB Output is correct
64 Correct 1323 ms 3180 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1431 ms 4036 KB Output is correct
68 Correct 1462 ms 3584 KB Output is correct
69 Correct 1255 ms 3180 KB Output is correct
70 Correct 1445 ms 3564 KB Output is correct
71 Correct 1376 ms 3564 KB Output is correct
72 Correct 1345 ms 3436 KB Output is correct
73 Correct 1321 ms 3328 KB Output is correct
74 Correct 1441 ms 3692 KB Output is correct
75 Correct 1369 ms 3308 KB Output is correct
76 Correct 1452 ms 3744 KB Output is correct
77 Correct 217 ms 3820 KB Output is correct
78 Correct 70 ms 3436 KB Output is correct
79 Correct 146 ms 3308 KB Output is correct
80 Correct 157 ms 3436 KB Output is correct
81 Correct 140 ms 3180 KB Output is correct
82 Correct 118 ms 3692 KB Output is correct
83 Correct 86 ms 3308 KB Output is correct
84 Correct 849 ms 3820 KB Output is correct
85 Correct 1543 ms 3908 KB Output is correct
86 Correct 2 ms 364 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 1548 ms 3996 KB Output is correct
89 Correct 296 ms 1132 KB Output is correct
90 Correct 1 ms 364 KB Output is correct