oj.uz

답안 #895684

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
895684 2023-12-30T14:05:06 Z CyberCow Chessboard (IZhO18_chessboard) C++17
70 / 100
 215 ms 2684 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++)
        {
            ll sev, sptiak;
            sev = min(x / k * k + k, x1 + 1) - x;
            sev += max((x1 / k * k) - (x / k * k + k), 0LL) / k / 2 * k;
            if ((max((x1 / k * k) - (x / k * k + k), 0LL) / k) % 2 == 1)
            {
                sev += x1 - x1 / k * k + 1;
            }
            sptiak = x1 - x + 1 - sev;
            ll sevy, sptiaky;
            sevy = min(y / k * k + k, y1 + 1) - y;
            sevy += max((y1 / k * k) - (y / k * k + k), 0LL) / k / 2 * k;
            if ((max((y1 / k * k) - (y / k * k + k), 0LL) / k) % 2 == 1)
            {
                sevy += y1 - y1 / k * k + 1;
            }
            sptiaky = y1 - y + 1 - sevy;
            ll obshisev = sev * sevy + sptiaky * sptiak;
            ll obshisptiak = sevy * sptiak + sptiaky * sev;
            if (((x - 1) / baj[j] + (y - 1) / baj[j]) % 2 == 1)
            {
                ans[j].first-=obshisev - obshisptiak;
                ans[j].second-=obshisptiak - obshisev;
            }
            else
            {
                ans[j].first-=obshisptiak - obshisev;
                ans[j].second-=obshisev - obshisptiak;
            }
        }
    }
    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:95: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]
   95 |     for ( i = 0; i < baj.size(); i++)
      |                  ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 1860 KB Output is correct
2 Correct 5 ms 600 KB Output is correct
3 Correct 10 ms 1372 KB Output is correct
4 Correct 11 ms 1116 KB Output is correct
5 Correct 14 ms 1628 KB Output is correct
6 Correct 11 ms 1116 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 10 ms 1092 KB Output is correct
9 Correct 23 ms 2388 KB Output is correct
10 Correct 14 ms 1624 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 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 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 476 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 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 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 476 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 7 ms 856 KB Output is correct
17 Correct 19 ms 1596 KB Output is correct
18 Correct 24 ms 1884 KB Output is correct
19 Correct 51 ms 1876 KB Output is correct
20 Correct 61 ms 1848 KB Output is correct
21 Correct 18 ms 1628 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 13 ms 1152 KB Output is correct
24 Correct 22 ms 1884 KB Output is correct
25 Correct 3 ms 604 KB Output is correct
26 Correct 20 ms 1372 KB Output is correct
27 Correct 21 ms 1348 KB Output is correct
28 Correct 24 ms 1884 KB Output is correct
29 Correct 7 ms 860 KB Output is correct
30 Correct 1 ms 348 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 1860 KB Output is correct
2 Correct 5 ms 600 KB Output is correct
3 Correct 10 ms 1372 KB Output is correct
4 Correct 11 ms 1116 KB Output is correct
5 Correct 14 ms 1628 KB Output is correct
6 Correct 11 ms 1116 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 10 ms 1092 KB Output is correct
9 Correct 23 ms 2388 KB Output is correct
10 Correct 14 ms 1624 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 464 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 0 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 0 ms 348 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 476 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 7 ms 856 KB Output is correct
27 Correct 19 ms 1596 KB Output is correct
28 Correct 24 ms 1884 KB Output is correct
29 Correct 51 ms 1876 KB Output is correct
30 Correct 61 ms 1848 KB Output is correct
31 Correct 18 ms 1628 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 13 ms 1152 KB Output is correct
34 Correct 22 ms 1884 KB Output is correct
35 Correct 3 ms 604 KB Output is correct
36 Correct 20 ms 1372 KB Output is correct
37 Correct 21 ms 1348 KB Output is correct
38 Correct 24 ms 1884 KB Output is correct
39 Correct 7 ms 860 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 52 ms 2220 KB Output is correct
42 Correct 27 ms 2640 KB Output is correct
43 Correct 34 ms 2648 KB Output is correct
44 Correct 26 ms 2388 KB Output is correct
45 Correct 25 ms 2640 KB Output is correct
46 Correct 56 ms 2644 KB Output is correct
47 Correct 23 ms 2360 KB Output is correct
48 Correct 37 ms 2384 KB Output is correct
49 Correct 25 ms 2240 KB Output is correct
50 Correct 201 ms 2500 KB Output is correct
51 Correct 212 ms 2608 KB Output is correct
52 Correct 204 ms 2384 KB Output is correct
53 Correct 207 ms 2612 KB Output is correct
54 Correct 191 ms 2348 KB Output is correct
55 Correct 215 ms 2624 KB Output is correct
56 Correct 185 ms 2476 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 472 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 16 ms 1860 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 10 ms 1372 KB Output is correct
12 Correct 11 ms 1116 KB Output is correct
13 Correct 14 ms 1628 KB Output is correct
14 Correct 11 ms 1116 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 10 ms 1092 KB Output is correct
17 Correct 23 ms 2388 KB Output is correct
18 Correct 14 ms 1624 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 464 KB Output is correct
21 Correct 0 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 0 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 0 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 476 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 7 ms 856 KB Output is correct
35 Correct 19 ms 1596 KB Output is correct
36 Correct 24 ms 1884 KB Output is correct
37 Correct 51 ms 1876 KB Output is correct
38 Correct 61 ms 1848 KB Output is correct
39 Correct 18 ms 1628 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 13 ms 1152 KB Output is correct
42 Correct 22 ms 1884 KB Output is correct
43 Correct 3 ms 604 KB Output is correct
44 Correct 20 ms 1372 KB Output is correct
45 Correct 21 ms 1348 KB Output is correct
46 Correct 24 ms 1884 KB Output is correct
47 Correct 7 ms 860 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 52 ms 2220 KB Output is correct
50 Correct 27 ms 2640 KB Output is correct
51 Correct 34 ms 2648 KB Output is correct
52 Correct 26 ms 2388 KB Output is correct
53 Correct 25 ms 2640 KB Output is correct
54 Correct 56 ms 2644 KB Output is correct
55 Correct 23 ms 2360 KB Output is correct
56 Correct 37 ms 2384 KB Output is correct
57 Correct 25 ms 2240 KB Output is correct
58 Correct 201 ms 2500 KB Output is correct
59 Correct 212 ms 2608 KB Output is correct
60 Correct 204 ms 2384 KB Output is correct
61 Correct 207 ms 2612 KB Output is correct
62 Correct 191 ms 2348 KB Output is correct
63 Correct 215 ms 2624 KB Output is correct
64 Correct 185 ms 2476 KB Output is correct
65 Correct 1 ms 604 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Incorrect 201 ms 2684 KB Output isn't correct
68 Halted 0 ms 0 KB -