oj.uz

답안 #378517

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
378517 2021-03-17T01:20:39 Z jass921026 Chessboard (IZhO18_chessboard) C++14
39 / 100
 74 ms 1132 KB 
#include<bits/stdc++.h>
using namespace std;
#define jizz ios_base::sync_with_stdio(false);cin.tie(NULL);
typedef long long ll;
typedef pair<int,int> pii;
#define F first
#define S second
#define FOR(i,n) for(int i=0;i<n;i++)
#define FOO(i,a,b) for(int i=a;i<=b;i++)
#define OOF(i,a,b) for(int i=a;i>=b;i--)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
#define mkp make_pair
const int MAXN=1E5+10;
int n, k;
pii point[MAXN];
ll solve(int i){
    ll col=i*i*(((n/i)*(n/i)+1)/2), rights=0, wrongs=0;
    for(int j=0;j<k;j++){
        if((point[j].F/i)%2==(point[j].S/i)%2){
            rights++;
        } else{
            wrongs++;
        }
    }
    return min(col-rights+wrongs,(n*n-col)-wrongs+rights);
}
int main(){ jizz
    cin>>n>>k;
    FOR(i,k){
        int x1, y1, x2, y2;
        cin>>x1>>y1>>x2>>y2;
        point[i]=mkp(x1-1,y1-1);
    }
    ll ans=n*n;
    for(int i=1;i*i<=n;i++){
        if(n%i==0){
            ans=min(ans,solve(i));
            if(i>1) ans=min(ans,solve(n/i));
        }
    }
    cout<<ans<<"\n";
    return 0;
}
/*
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
*/

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 1 ms 364 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 27 ms 876 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 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 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

# 결과 실행 시간 메모리 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 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 10 ms 640 KB Output is correct
17 Correct 27 ms 1004 KB Output is correct
18 Correct 36 ms 1132 KB Output is correct
19 Correct 66 ms 1092 KB Output is correct
20 Correct 74 ms 1132 KB Output is correct
21 Correct 26 ms 1004 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 18 ms 620 KB Output is correct
24 Correct 32 ms 1004 KB Output is correct
25 Correct 4 ms 364 KB Output is correct
26 Correct 22 ms 748 KB Output is correct
27 Correct 28 ms 876 KB Output is correct
28 Correct 34 ms 1132 KB Output is correct
29 Correct 11 ms 620 KB Output is correct
30 Correct 2 ms 364 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 27 ms 876 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 1 ms 364 KB Output is correct
9 Incorrect 27 ms 876 KB Output isn't correct
10 Halted 0 ms 0 KB -