#864674 (C++14) No.5016 Worst Mayor

• 問題: No.5016 Worst Mayor
• ユーザー: tanu
• 提出日時: 2023-04-29 16:46:14
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 87 ms / 2,000 ms
• コード長: 1,699 bytes
• コンパイル時間: 1,796 ms
• コンパイル使用メモリ: 174,628 KB
• 実行使用メモリ: 24,396 KB
• スコア: 990,000,000
• 平均クエリ数: 400.00
• 最終ジャッジ日時: 2023-04-29 16:46:25
• 合計ジャッジ時間: 9,146 ms
• ジャッジサーバーID （参考情報）: judge15 / judge16

ファイルパターン	結果
other	AC * 50

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
    ll n, t, x1, y1, x2, y2, u, v, cnt = 0, x, y;
    ll map[27][27] = {0};
    vector<pair<ll, ll>> num;
    cin >> n >> t;
    vector<pair<ll, ll>> a, b;
    for (ll i = 0; i < n; i++)
    {
        cin >> x1 >> y1;
        a.push_back({x1, y1});
        cin >> x2 >> y2;
        b.push_back({x2, y2});
        if (x1 > x2)
        {
            swap(x1, x2);
        }
        if (y1 > y2)
        {
            swap(y1, y2);
        }
        for (ll p = 2 * x1 - 1; p < 2 * x2 - 2; p += 2)
        {
            for (ll q = 2 * y1 - 1; q < 2 * y2 - 2; q += 2)
            {
                map[p][q]++;
            }
        }
    }
    for (ll i = 1; i < 27; i += 2)
    {
        for (ll j = 1; j < 27; j += 2)
        {
            num.push_back({map[i][j], i + j});
        }
    }
    sort(num.begin(), num.end());
    ll i = 0;
    /*if (num[cnt].first * 30 * 25 >= 2500000)
    {
        x = num[cnt].second % 27;
        y = num[cnt].second / 27;
        if (x % 2 == 1)
        {
            cout << 1 << " " << x / 2 + 1 << " " << y / 2 + 1 << " " << x / 2 + 2 << " " << y / 2 + 1 << endl;
        }
        else
        {
            cout << 1 << " " << x / 2 + 1 << " " << y / 2 + 1 << " " << x / 2 + 1 << " " << y / 2 + 2 << endl;
        }
        cnt++;
        i++;
    }*/
    for (; i < t; i++)
    {
        cin >> u >> v;
        if (i < 24)
        {
            cout << 2 << endl;
        }
        else if (i < 400)
        {
            if (num[cnt].first * 30 * (399 - i) >= ll(10000000 / sqrt(v)) + 50000)
            {
                x = num[cnt].second % 27;
                y = num[cnt].second / 27;
                if (x % 2 == 1)
                {
                    cout << 1 << " " << x / 2 + 1 << " " << y / 2 + 1 << " " << x / 2 + 2 << " " << y / 2 + 1 << endl;
                }
                else
                {
                    cout << 1 << " " << x / 2 + 1 << " " << y / 2 + 1 << " " << x / 2 + 1 << " " << y / 2 + 2 << endl;
                }
                cnt++;
            }
            else
            {
                cout << 3 << endl;
            }
        }
        else
        {
            cout << 3 << endl;
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX