답안 #894706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894706 2023-12-28T18:26:33 Z CyberCow Chessboard (IZhO18_chessboard) C++17
70 / 100
204 ms 2748 KB
#include <random>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#define fr first
#define sc second
#define ad push_back
using namespace std;
using ll = long long;
mt19937 rnd(348502);

const int N = 100005;

pair<ll, ll> ans[N];

void solve()
{
    ll n, i, j, x, y, x1, y1, k;
    cin >> n >> k;
    vector<ll> baj;
    baj.push_back(1);
    for ( i = 2; i * i < n; i++)
    {
        if (n % i == 0)
        {
            baj.push_back(i);
            baj.push_back(n / i);
        }
    }
    if (i * i == n)
        baj.push_back(i);
    for ( i = 0; i < baj.size(); i++)
    {
        if ((n / baj[i]) % 2 == 1)
        {
            ans[i] = { (n / baj[i]) * (n / baj[i]) / 2 * baj[i] * baj[i], ((n / baj[i]) * (n / baj[i]) / 2 + 1) * baj[i] * baj[i] };
        }
        else
        {
            ans[i] = { n * n / 2, n * n / 2 };
        }
    }
    for ( i = 0; i < k; i++)
    {
        cin >> x >> y >> x1 >> y1;
        for ( j = 0; j < baj.size(); j++)
        {
            if (((x - 1) / baj[j] + (y - 1) / baj[j]) % 2 == 1)
            {
                ans[j].first--;
                ans[j].second++;
            }
            else
            {
                ans[j].first++;
                ans[j].second--;
            }
        }
    }
    ll anss = 1e18;
    for ( i = 0; i < baj.size(); i++)
    {
        anss = min(anss, min(ans[i].first, ans[i].second));
    }
    cout << anss;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}

Compilation message

chessboard.cpp: In function 'void solve()':
chessboard.cpp:48:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for ( i = 0; i < baj.size(); i++)
      |                  ~~^~~~~~~~~~~~
chessboard.cpp:62:24: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         for ( j = 0; j < baj.size(); j++)
      |                      ~~^~~~~~~~~~~~
chessboard.cpp:77:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     for ( i = 0; i < baj.size(); i++)
      |                  ~~^~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 348 KB Output is correct
2 Correct 4 ms 604 KB Output is correct
3 Correct 10 ms 1372 KB Output is correct
4 Correct 10 ms 1116 KB Output is correct
5 Correct 15 ms 1600 KB Output is correct
6 Correct 9 ms 1116 KB Output is correct
7 Correct 2 ms 476 KB Output is correct
8 Correct 9 ms 1116 KB Output is correct
9 Correct 26 ms 2504 KB Output is correct
10 Correct 13 ms 1624 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 16 ms 348 KB Output is correct
18 Correct 24 ms 344 KB Output is correct
19 Correct 47 ms 448 KB Output is correct
20 Correct 59 ms 444 KB Output is correct
21 Correct 16 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 12 ms 348 KB Output is correct
24 Correct 20 ms 464 KB Output is correct
25 Correct 3 ms 344 KB Output is correct
26 Correct 15 ms 468 KB Output is correct
27 Correct 17 ms 344 KB Output is correct
28 Correct 21 ms 344 KB Output is correct
29 Correct 7 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 348 KB Output is correct
2 Correct 4 ms 604 KB Output is correct
3 Correct 10 ms 1372 KB Output is correct
4 Correct 10 ms 1116 KB Output is correct
5 Correct 15 ms 1600 KB Output is correct
6 Correct 9 ms 1116 KB Output is correct
7 Correct 2 ms 476 KB Output is correct
8 Correct 9 ms 1116 KB Output is correct
9 Correct 26 ms 2504 KB Output is correct
10 Correct 13 ms 1624 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 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 8 ms 344 KB Output is correct
27 Correct 16 ms 348 KB Output is correct
28 Correct 24 ms 344 KB Output is correct
29 Correct 47 ms 448 KB Output is correct
30 Correct 59 ms 444 KB Output is correct
31 Correct 16 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 12 ms 348 KB Output is correct
34 Correct 20 ms 464 KB Output is correct
35 Correct 3 ms 344 KB Output is correct
36 Correct 15 ms 468 KB Output is correct
37 Correct 17 ms 344 KB Output is correct
38 Correct 21 ms 344 KB Output is correct
39 Correct 7 ms 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 48 ms 2224 KB Output is correct
42 Correct 26 ms 2620 KB Output is correct
43 Correct 32 ms 2396 KB Output is correct
44 Correct 24 ms 2652 KB Output is correct
45 Correct 24 ms 2748 KB Output is correct
46 Correct 52 ms 2508 KB Output is correct
47 Correct 21 ms 2392 KB Output is correct
48 Correct 29 ms 2388 KB Output is correct
49 Correct 23 ms 2388 KB Output is correct
50 Correct 183 ms 2648 KB Output is correct
51 Correct 195 ms 2748 KB Output is correct
52 Correct 181 ms 2384 KB Output is correct
53 Correct 194 ms 2732 KB Output is correct
54 Correct 183 ms 2384 KB Output is correct
55 Correct 204 ms 2644 KB Output is correct
56 Correct 175 ms 2388 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 15 ms 348 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 10 ms 1372 KB Output is correct
12 Correct 10 ms 1116 KB Output is correct
13 Correct 15 ms 1600 KB Output is correct
14 Correct 9 ms 1116 KB Output is correct
15 Correct 2 ms 476 KB Output is correct
16 Correct 9 ms 1116 KB Output is correct
17 Correct 26 ms 2504 KB Output is correct
18 Correct 13 ms 1624 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 600 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 600 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 16 ms 348 KB Output is correct
36 Correct 24 ms 344 KB Output is correct
37 Correct 47 ms 448 KB Output is correct
38 Correct 59 ms 444 KB Output is correct
39 Correct 16 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 12 ms 348 KB Output is correct
42 Correct 20 ms 464 KB Output is correct
43 Correct 3 ms 344 KB Output is correct
44 Correct 15 ms 468 KB Output is correct
45 Correct 17 ms 344 KB Output is correct
46 Correct 21 ms 344 KB Output is correct
47 Correct 7 ms 344 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 48 ms 2224 KB Output is correct
50 Correct 26 ms 2620 KB Output is correct
51 Correct 32 ms 2396 KB Output is correct
52 Correct 24 ms 2652 KB Output is correct
53 Correct 24 ms 2748 KB Output is correct
54 Correct 52 ms 2508 KB Output is correct
55 Correct 21 ms 2392 KB Output is correct
56 Correct 29 ms 2388 KB Output is correct
57 Correct 23 ms 2388 KB Output is correct
58 Correct 183 ms 2648 KB Output is correct
59 Correct 195 ms 2748 KB Output is correct
60 Correct 181 ms 2384 KB Output is correct
61 Correct 194 ms 2732 KB Output is correct
62 Correct 183 ms 2384 KB Output is correct
63 Correct 204 ms 2644 KB Output is correct
64 Correct 175 ms 2388 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Incorrect 0 ms 348 KB Output isn't correct
67 Halted 0 ms 0 KB -