#302290 (C++14) No.759 悪くない忘年会にしような！

• 問題: No.759 悪くない忘年会にしような！
• ユーザー: nebukuro09
• 提出日時: 2018-12-07 07:42:01
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: TLE
• 実行時間: -
• コード長: 2,137 bytes
• コンパイル時間: 2,007 ms
• コンパイル使用メモリ: 182,624 KB
• 実行使用メモリ: 59,980 KB
• 最終ジャッジ日時: 2024-09-14 03:14:14
• 合計ジャッジ時間: 11,137 ms
• ジャッジサーバーID （参考情報）: judge4 / judge6

ファイルパターン	結果
sample	AC * 3
other	AC * 41 TLE * 1 -- * 22

ソースコード

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
92
93
94
95
96
97
98
99
100
101
102
103
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
#define REP2(i,m,n) for (int i=m;i<(n);i++)
typedef long long ll;
typedef long double ld;
const int M = 10001;
typedef bitset<M> bs;
int N;
vector<int> A[101010];
vector<int> B[101010];
bool ng[101010];
class SegmentTree {
public:
    vector<bs> table;
    int size;
    SegmentTree(int n) {
        size = 1;
        while (size <= n) size *= 2;
        size *= 2;
        table = vector<bs>(size);
    }
    void add(int pos, int num) {
        return add(pos, num, 0, 0, size/2-1);
    }
    void add(int pos, int num, int i, int left, int right) {
        if (left == right) {
            table[i][num] = true;
            return;
        }
        int mid = (left + right) / 2;
        if (pos <= mid)
            add(pos, num, i*2+1, left, mid);
        else
            add(pos, num, i*2+2, mid+1, right);
        table[i] = table[i*2+1] | table[i*2+2];
    }
    bs query(int pl, int pr) {
        return query(pl, pr, 0, 0, size/2-1);
    }
    bs query(int pl, int pr, int i, int left, int right) {
        if (pl > right || pr < left)
            return bs(0);
        else if (pl <= left && right <= pr)
            return table[i];
        else
            return
                query(pl, pr, i*2+1, left, (left+right)/2) |
                query(pl, pr, i*2+2, (left+right)/2+1, right);
    }
};
void solve2(int x) {
    REP(i, N) B[i] = A[i];
    REP(i, N) swap(B[i][0], B[i][x]);
    sort(B, B+N);
    SegmentTree st = SegmentTree(M);
    for (int i = N - 1, j = N - 1; i >= 0; --i) {
        while (j >= 0 && B[j][0] > B[i][0]) {
            st.add(B[j][1], B[j][2]);
            --j;
        }
        bs b = st.query(B[i][1], M);
        b >>= B[i][2];
        if (b.count()) ng[B[i][3]] = true;
    }
}
void solve() {
    cin >> N;
    REP(i, N) {
        A[i] = vector<int>(4);
        REP(j, 3) cin >> A[i][j];
        A[i][3] = i;
    }
    solve2(0);
    solve2(1);
    solve2(2);
    REP(i, N) if (!ng[i]) cout << i+1 << "\n";
}
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX