oj.uz

답안 #911104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
911104 2024-01-18T12:58:35 Z GrindMachine Chessboard (IZhO18_chessboard) C++17
70 / 100
 169 ms 5720 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    vector<array<ll,4>> a(m);
    rep(i,m) rep(j,4) cin >> a[i][j], a[i][j]--;

    ll ans = inf2;

    rep1(k,n-1){
        if(n%k) conts;

        ll curr_ans = 0;
        rep(i,m){
            ll x = a[i][0], y = a[i][1];
            ll id = (x/k)+(y/k);
            if(id&1){
                curr_ans--;
            }
            else{
                curr_ans++;
            }
        }

        ll cnt = n/k;
        ll black = ceil2(cnt,2)*(cnt/2)*2*k*k;
        curr_ans += black;
        curr_ans = min(curr_ans,n*n-curr_ans);

        amin(ans,curr_ans);
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 356 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 3676 KB Output is correct
2 Correct 5 ms 1116 KB Output is correct
3 Correct 17 ms 2580 KB Output is correct
4 Correct 13 ms 2652 KB Output is correct
5 Correct 16 ms 3416 KB Output is correct
6 Correct 14 ms 2312 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 10 ms 2140 KB Output is correct
9 Correct 26 ms 5316 KB Output is correct
10 Correct 15 ms 3164 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 11 ms 1628 KB Output is correct
17 Correct 28 ms 4444 KB Output is correct
18 Correct 29 ms 4944 KB Output is correct
19 Correct 45 ms 4492 KB Output is correct
20 Correct 61 ms 5080 KB Output is correct
21 Correct 24 ms 4184 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 13 ms 2396 KB Output is correct
24 Correct 24 ms 4692 KB Output is correct
25 Correct 3 ms 856 KB Output is correct
26 Correct 15 ms 2984 KB Output is correct
27 Correct 19 ms 3600 KB Output is correct
28 Correct 29 ms 4956 KB Output is correct
29 Correct 12 ms 1884 KB Output is correct
30 Correct 1 ms 580 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 3676 KB Output is correct
2 Correct 5 ms 1116 KB Output is correct
3 Correct 17 ms 2580 KB Output is correct
4 Correct 13 ms 2652 KB Output is correct
5 Correct 16 ms 3416 KB Output is correct
6 Correct 14 ms 2312 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 10 ms 2140 KB Output is correct
9 Correct 26 ms 5316 KB Output is correct
10 Correct 15 ms 3164 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 356 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 432 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 11 ms 1628 KB Output is correct
27 Correct 28 ms 4444 KB Output is correct
28 Correct 29 ms 4944 KB Output is correct
29 Correct 45 ms 4492 KB Output is correct
30 Correct 61 ms 5080 KB Output is correct
31 Correct 24 ms 4184 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 13 ms 2396 KB Output is correct
34 Correct 24 ms 4692 KB Output is correct
35 Correct 3 ms 856 KB Output is correct
36 Correct 15 ms 2984 KB Output is correct
37 Correct 19 ms 3600 KB Output is correct
38 Correct 29 ms 4956 KB Output is correct
39 Correct 12 ms 1884 KB Output is correct
40 Correct 1 ms 580 KB Output is correct
41 Correct 54 ms 4956 KB Output is correct
42 Correct 38 ms 5456 KB Output is correct
43 Correct 33 ms 4844 KB Output is correct
44 Correct 28 ms 5468 KB Output is correct
45 Correct 27 ms 5712 KB Output is correct
46 Correct 48 ms 5396 KB Output is correct
47 Correct 36 ms 4944 KB Output is correct
48 Correct 29 ms 5200 KB Output is correct
49 Correct 28 ms 4956 KB Output is correct
50 Correct 146 ms 5452 KB Output is correct
51 Correct 168 ms 5720 KB Output is correct
52 Correct 150 ms 5200 KB Output is correct
53 Correct 169 ms 5712 KB Output is correct
54 Correct 142 ms 5212 KB Output is correct
55 Correct 159 ms 5716 KB Output is correct
56 Correct 140 ms 5200 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 356 KB Output is correct
9 Correct 22 ms 3676 KB Output is correct
10 Correct 5 ms 1116 KB Output is correct
11 Correct 17 ms 2580 KB Output is correct
12 Correct 13 ms 2652 KB Output is correct
13 Correct 16 ms 3416 KB Output is correct
14 Correct 14 ms 2312 KB Output is correct
15 Correct 3 ms 860 KB Output is correct
16 Correct 10 ms 2140 KB Output is correct
17 Correct 26 ms 5316 KB Output is correct
18 Correct 15 ms 3164 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 356 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 432 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 11 ms 1628 KB Output is correct
35 Correct 28 ms 4444 KB Output is correct
36 Correct 29 ms 4944 KB Output is correct
37 Correct 45 ms 4492 KB Output is correct
38 Correct 61 ms 5080 KB Output is correct
39 Correct 24 ms 4184 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 13 ms 2396 KB Output is correct
42 Correct 24 ms 4692 KB Output is correct
43 Correct 3 ms 856 KB Output is correct
44 Correct 15 ms 2984 KB Output is correct
45 Correct 19 ms 3600 KB Output is correct
46 Correct 29 ms 4956 KB Output is correct
47 Correct 12 ms 1884 KB Output is correct
48 Correct 1 ms 580 KB Output is correct
49 Correct 54 ms 4956 KB Output is correct
50 Correct 38 ms 5456 KB Output is correct
51 Correct 33 ms 4844 KB Output is correct
52 Correct 28 ms 5468 KB Output is correct
53 Correct 27 ms 5712 KB Output is correct
54 Correct 48 ms 5396 KB Output is correct
55 Correct 36 ms 4944 KB Output is correct
56 Correct 29 ms 5200 KB Output is correct
57 Correct 28 ms 4956 KB Output is correct
58 Correct 146 ms 5452 KB Output is correct
59 Correct 168 ms 5720 KB Output is correct
60 Correct 150 ms 5200 KB Output is correct
61 Correct 169 ms 5712 KB Output is correct
62 Correct 142 ms 5212 KB Output is correct
63 Correct 159 ms 5716 KB Output is correct
64 Correct 140 ms 5200 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Incorrect 1 ms 348 KB Output isn't correct
67 Halted 0 ms 0 KB -