oj.uz

답안 #799880

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
799880 2023-08-01T07:29:54 Z phoenix Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 177 ms 78820 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 5e5 + 10;
vector<int> g[N];
vector<int> order;
vector<bool> us;

void topsort(int s) {
    us[s] = 1;
    for(int to : g[s]) {
        if(us[to]) continue;
        topsort(to);
    }
    order.push_back(s);
}
void dfs(int s) {
    us[s] = 1;
    for(int to : g[s]) {
        if(us[to]) continue;
        dfs(to);
    }
}

int n;
pair<ll, ll> pnts[N];
ll A[N], B[N];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++) 
        cin >> pnts[i].first >> pnts[i].second;
    sort(pnts + 1, pnts + n + 1);
    for(int i = 1; i <= n; i++) 
        A[i] = pnts[i].second - pnts[i].first,
        B[i] = pnts[i].second + pnts[i].first;
    
    vector<int> v;
    for(int i = 1; i <= n; i++) {
        while(!v.empty() && A[v.back()] <= A[i]) {
            g[i].push_back(v.back());
            v.pop_back();
        }
        v.push_back(i);
    }
    v.clear();
    for(int i = n; i >= 1; i--) {
        while(!v.empty() && B[v.back()] <= B[i]) {
            g[i].push_back(v.back());
            v.pop_back();
        }
        v.push_back(i);
    }
    us.assign(n + 1, false);
    for(int i = 1; i <= n; i++) {
        if(!us[i]) topsort(i);
    }

    reverse(order.begin(), order.end());
    us.assign(n + 1, false);
    int cmp = 0;
    for(int c : order) {
        if(!us[c]) dfs(c), cmp++;
    }
    cout << cmp;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 46 ms 20400 KB Output is correct
3 Correct 65 ms 27368 KB Output is correct
4 Correct 147 ms 52168 KB Output is correct
5 Correct 97 ms 56256 KB Output is correct
6 Correct 139 ms 44604 KB Output is correct
7 Correct 158 ms 53968 KB Output is correct
8 Correct 158 ms 55340 KB Output is correct
9 Correct 141 ms 78820 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12068 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 12068 KB Output is correct
4 Correct 5 ms 11988 KB Output is correct
5 Correct 6 ms 12068 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 12068 KB Output is correct
8 Correct 6 ms 12016 KB Output is correct
9 Correct 6 ms 12116 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 6 ms 12072 KB Output is correct
12 Correct 5 ms 11988 KB Output is correct
13 Correct 6 ms 11988 KB Output is correct
14 Correct 6 ms 11988 KB Output is correct
15 Correct 6 ms 11988 KB Output is correct
16 Correct 6 ms 12000 KB Output is correct
17 Correct 6 ms 11988 KB Output is correct
18 Correct 6 ms 11988 KB Output is correct

Subtask #3
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12068 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 12068 KB Output is correct
4 Correct 5 ms 11988 KB Output is correct
5 Correct 6 ms 12068 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 12068 KB Output is correct
8 Correct 6 ms 12016 KB Output is correct
9 Correct 6 ms 12116 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 6 ms 12072 KB Output is correct
12 Correct 5 ms 11988 KB Output is correct
13 Correct 6 ms 11988 KB Output is correct
14 Correct 6 ms 11988 KB Output is correct
15 Correct 6 ms 11988 KB Output is correct
16 Correct 6 ms 12000 KB Output is correct
17 Correct 6 ms 11988 KB Output is correct
18 Correct 6 ms 11988 KB Output is correct
19 Correct 6 ms 12084 KB Output is correct
20 Correct 6 ms 12084 KB Output is correct
21 Correct 7 ms 12100 KB Output is correct
22 Correct 6 ms 12100 KB Output is correct
23 Correct 6 ms 12080 KB Output is correct
24 Correct 6 ms 12084 KB Output is correct
25 Correct 6 ms 12132 KB Output is correct
26 Correct 6 ms 12084 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 46 ms 20400 KB Output is correct
3 Correct 65 ms 27368 KB Output is correct
4 Correct 147 ms 52168 KB Output is correct
5 Correct 97 ms 56256 KB Output is correct
6 Correct 139 ms 44604 KB Output is correct
7 Correct 158 ms 53968 KB Output is correct
8 Correct 158 ms 55340 KB Output is correct
9 Correct 141 ms 78820 KB Output is correct
10 Correct 6 ms 12068 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 6 ms 12068 KB Output is correct
13 Correct 5 ms 11988 KB Output is correct
14 Correct 6 ms 12068 KB Output is correct
15 Correct 6 ms 11988 KB Output is correct
16 Correct 6 ms 12068 KB Output is correct
17 Correct 6 ms 12016 KB Output is correct
18 Correct 6 ms 12116 KB Output is correct
19 Correct 6 ms 11988 KB Output is correct
20 Correct 6 ms 12072 KB Output is correct
21 Correct 5 ms 11988 KB Output is correct
22 Correct 6 ms 11988 KB Output is correct
23 Correct 6 ms 11988 KB Output is correct
24 Correct 6 ms 11988 KB Output is correct
25 Correct 6 ms 12000 KB Output is correct
26 Correct 6 ms 11988 KB Output is correct
27 Correct 6 ms 11988 KB Output is correct
28 Correct 6 ms 12084 KB Output is correct
29 Correct 6 ms 12084 KB Output is correct
30 Correct 7 ms 12100 KB Output is correct
31 Correct 6 ms 12100 KB Output is correct
32 Correct 6 ms 12080 KB Output is correct
33 Correct 6 ms 12084 KB Output is correct
34 Correct 6 ms 12132 KB Output is correct
35 Correct 6 ms 12084 KB Output is correct
36 Correct 116 ms 38888 KB Output is correct
37 Correct 153 ms 45760 KB Output is correct
38 Correct 177 ms 51520 KB Output is correct
39 Correct 168 ms 48888 KB Output is correct
40 Correct 177 ms 51448 KB Output is correct
41 Correct 175 ms 53120 KB Output is correct
42 Correct 176 ms 57996 KB Output is correct
43 Correct 151 ms 47128 KB Output is correct
44 Correct 165 ms 50896 KB Output is correct
45 Correct 113 ms 38560 KB Output is correct