oj.uz

답안 #926630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926630 2024-02-13T12:45:07 Z De3b0o Advertisement 2 (JOI23_ho_t2) C++14
59 / 100
 2000 ms 15964 KB 
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define er erase
#define pb push_back
#define ppb pop_back()
#define ph push
#define pp pop()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "YES" << "\n";
#define no cout << "NO" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007

using namespace std;

pll a[500009];
vector<ll> adj[500009];
bool vis[500009];

void dfs(ll n)
{
    if(vis[n])
        return;
    vis[n]=1;
    for(auto it : adj[n])
        dfs(it);
}

int main()
{
    d3
    ll n;
    cin >> n;
    for(int i = 0 ; n>i ; i++)
        cin >> a[i].S >> a[i].F;
    sort(a,a+n);
    for(int i = n-1 ; i>=0 ; i--)
        for(int j = i-1 ; j>=0 ; j--)
            if(a[i].F-a[j].F>=abs(a[i].S-a[j].S))
                adj[i].pb(j);
    ll ans = 0;
    for(int i = n-1 ; i>=0 ; i--)
    {
        if(vis[i])
            continue;
        ans++;
        dfs(i);
    }
    cans
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Execution timed out 2085 ms 15084 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 4 ms 12636 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12632 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 3 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 3 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 3 ms 12636 KB Output is correct
17 Correct 3 ms 12832 KB Output is correct
18 Correct 2 ms 12704 KB Output is correct

Subtask #3
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 4 ms 12636 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12632 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 3 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 3 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 3 ms 12636 KB Output is correct
17 Correct 3 ms 12832 KB Output is correct
18 Correct 2 ms 12704 KB Output is correct
19 Correct 6 ms 15196 KB Output is correct
20 Correct 6 ms 15708 KB Output is correct
21 Correct 6 ms 15452 KB Output is correct
22 Correct 6 ms 15704 KB Output is correct
23 Correct 6 ms 15580 KB Output is correct
24 Correct 6 ms 15964 KB Output is correct
25 Correct 6 ms 15452 KB Output is correct
26 Correct 4 ms 13148 KB Output is correct

Subtask #4
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Execution timed out 2085 ms 15084 KB Time limit exceeded
3 Halted 0 ms 0 KB -