oj.uz

Submission #493358

# Submission time Handle Problem Language Result Execution time Memory
493358 2021-12-11T06:56:48 Z irmuun Chessboard (IZhO18_chessboard) C++17
70 / 100
 297 ms 4240 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define PI 3.14159265359
ll n,m,t,p,h,a,b,c,d,e,f,i,j,k,r,l,mod=1000000007,mod1=998244353,MAX=1e18,ans;
ll X1[100001],X2[100001],Y1[100001],Y2[100001];
string s,u;
ll df[101];
vector<pair<ll,ll> >v;
vector<ll>dv[101];
void dfs(ll x){
    df[x]=1;
    for(ll i=0;i<dv[x].size();i++){
        if(df[dv[x][i]]==0){
            dfs(dv[x][i]);
        }
    }
}
ll fastPow(ll a,ll b){
    ll d=1;
    while(b>0){
        if(b%2==1){
            d=d*a%mod;
        }
        b/=2;
        a=a*a%mod;
    }
    return d;
}
ll check(){
    ll c=n/i;
    ll b,w;
    if(c%2==0){
        b=n*n/2;
        w=b;
    }
    else{
        b=(n-i)*(n+i)/2;
        w=b+(i*i);
    }
    ll num[2]={0};
    for(ll j=1;j<=k;j++){
        num[(((X1[j]-1)/i)+((Y1[j]-1)/i))%2]++;
    }
    return min((w-num[0])+num[1],(b-num[1])+num[0]);
}
int main(){
    cin>>n>>k;
    for(i=1;i<=k;i++){
        cin>>X1[i]>>Y1[i]>>X2[i]>>Y2[i];
    }
    if(k==0){
        ans=n*n/2;
        for(i=1;i<n;i++){
            if(n%i==0&&n/i%2==1){
                d=n*n-(i*i);
                ans=min(ans,d/2);
            }
        }
        cout<<ans;
        return 0;
    }
    p=0;
    for(i=2;i<=sqrt(n);i++){
        if(n%i==0){
            p=1;
            break;
        }
    }
    if(p==0){
        d=n*n/2;
        if(n==2){
            e=d;
        }
        else{
            e=d+1;
        }
        r=0;
        l=0;
        for(i=1;i<=k;i++){
            if((X1[i]+Y1[i])%2==0){
                r++;
            }
            else{
                l++;
            }
        }
        cout<<min((e-r)+l,(d-l)+r);
        return 0;
    }
    ans=n*n;
    for(i=1;i<n;i++){
        if(n%i==0){
            ans=min(ans,check());
        }
    }
    cout<<ans;
}

Compilation message

chessboard.cpp: In function 'void dfs(long long int)':
chessboard.cpp:16:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(ll i=0;i<dv[x].size();i++){
      |                ~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 2220 KB Output is correct
2 Correct 21 ms 708 KB Output is correct
3 Correct 45 ms 1460 KB Output is correct
4 Correct 53 ms 1636 KB Output is correct
5 Correct 60 ms 1932 KB Output is correct
6 Correct 49 ms 1368 KB Output is correct
7 Correct 8 ms 452 KB Output is correct
8 Correct 42 ms 1488 KB Output is correct
9 Correct 95 ms 3068 KB Output is correct
10 Correct 57 ms 1824 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 25 ms 1536 KB Output is correct
17 Correct 82 ms 3700 KB Output is correct
18 Correct 96 ms 4224 KB Output is correct
19 Correct 111 ms 3908 KB Output is correct
20 Correct 117 ms 4216 KB Output is correct
21 Correct 68 ms 3568 KB Output is correct
22 Correct 1 ms 308 KB Output is correct
23 Correct 41 ms 2248 KB Output is correct
24 Correct 84 ms 3908 KB Output is correct
25 Correct 8 ms 720 KB Output is correct
26 Correct 47 ms 2800 KB Output is correct
27 Correct 61 ms 3260 KB Output is correct
28 Correct 84 ms 4028 KB Output is correct
29 Correct 30 ms 1772 KB Output is correct
30 Correct 3 ms 332 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 2220 KB Output is correct
2 Correct 21 ms 708 KB Output is correct
3 Correct 45 ms 1460 KB Output is correct
4 Correct 53 ms 1636 KB Output is correct
5 Correct 60 ms 1932 KB Output is correct
6 Correct 49 ms 1368 KB Output is correct
7 Correct 8 ms 452 KB Output is correct
8 Correct 42 ms 1488 KB Output is correct
9 Correct 95 ms 3068 KB Output is correct
10 Correct 57 ms 1824 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 25 ms 1536 KB Output is correct
27 Correct 82 ms 3700 KB Output is correct
28 Correct 96 ms 4224 KB Output is correct
29 Correct 111 ms 3908 KB Output is correct
30 Correct 117 ms 4216 KB Output is correct
31 Correct 68 ms 3568 KB Output is correct
32 Correct 1 ms 308 KB Output is correct
33 Correct 41 ms 2248 KB Output is correct
34 Correct 84 ms 3908 KB Output is correct
35 Correct 8 ms 720 KB Output is correct
36 Correct 47 ms 2800 KB Output is correct
37 Correct 61 ms 3260 KB Output is correct
38 Correct 84 ms 4028 KB Output is correct
39 Correct 30 ms 1772 KB Output is correct
40 Correct 3 ms 332 KB Output is correct
41 Correct 130 ms 3632 KB Output is correct
42 Correct 105 ms 3996 KB Output is correct
43 Correct 101 ms 3632 KB Output is correct
44 Correct 99 ms 3912 KB Output is correct
45 Correct 99 ms 4156 KB Output is correct
46 Correct 127 ms 4044 KB Output is correct
47 Correct 90 ms 3760 KB Output is correct
48 Correct 104 ms 3764 KB Output is correct
49 Correct 90 ms 3704 KB Output is correct
50 Correct 252 ms 3984 KB Output is correct
51 Correct 285 ms 4168 KB Output is correct
52 Correct 247 ms 3956 KB Output is correct
53 Correct 282 ms 4200 KB Output is correct
54 Correct 267 ms 3908 KB Output is correct
55 Correct 297 ms 4240 KB Output is correct
56 Correct 245 ms 3820 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 67 ms 2220 KB Output is correct
10 Correct 21 ms 708 KB Output is correct
11 Correct 45 ms 1460 KB Output is correct
12 Correct 53 ms 1636 KB Output is correct
13 Correct 60 ms 1932 KB Output is correct
14 Correct 49 ms 1368 KB Output is correct
15 Correct 8 ms 452 KB Output is correct
16 Correct 42 ms 1488 KB Output is correct
17 Correct 95 ms 3068 KB Output is correct
18 Correct 57 ms 1824 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 25 ms 1536 KB Output is correct
35 Correct 82 ms 3700 KB Output is correct
36 Correct 96 ms 4224 KB Output is correct
37 Correct 111 ms 3908 KB Output is correct
38 Correct 117 ms 4216 KB Output is correct
39 Correct 68 ms 3568 KB Output is correct
40 Correct 1 ms 308 KB Output is correct
41 Correct 41 ms 2248 KB Output is correct
42 Correct 84 ms 3908 KB Output is correct
43 Correct 8 ms 720 KB Output is correct
44 Correct 47 ms 2800 KB Output is correct
45 Correct 61 ms 3260 KB Output is correct
46 Correct 84 ms 4028 KB Output is correct
47 Correct 30 ms 1772 KB Output is correct
48 Correct 3 ms 332 KB Output is correct
49 Correct 130 ms 3632 KB Output is correct
50 Correct 105 ms 3996 KB Output is correct
51 Correct 101 ms 3632 KB Output is correct
52 Correct 99 ms 3912 KB Output is correct
53 Correct 99 ms 4156 KB Output is correct
54 Correct 127 ms 4044 KB Output is correct
55 Correct 90 ms 3760 KB Output is correct
56 Correct 104 ms 3764 KB Output is correct
57 Correct 90 ms 3704 KB Output is correct
58 Correct 252 ms 3984 KB Output is correct
59 Correct 285 ms 4168 KB Output is correct
60 Correct 247 ms 3956 KB Output is correct
61 Correct 282 ms 4200 KB Output is correct
62 Correct 267 ms 3908 KB Output is correct
63 Correct 297 ms 4240 KB Output is correct
64 Correct 245 ms 3820 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Incorrect 1 ms 204 KB Output isn't correct
67 Halted 0 ms 0 KB -