답안 #328571

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
328571 2020-11-17T06:32:26 Z wind_reaper Lightning Rod (NOI18_lightningrod) C++17
80 / 100
2000 ms 247036 KB
// #define _GLIBCXX_DEBUG
// #pragma GCC optimize "trapv"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <chrono>

// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

using namespace std;
using namespace __gnu_pbds;
using namespace chrono;

#define pb push_back 
#define f first
#define s second
#define min3(a, b, c) min(min(a, b), c)
#define max3(a, b, c) max(max(a, b), c)
#define all(v) v.begin(), v.end()

typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

// const int INF = 1e9;
const ll INF = LLONG_MAX;
const ll mod = 1000000007;

// const ll mod = 998244353;
vpi a;
bool covers(int i, int j){
    if(abs(a[i].f - a[j].f) <= a[i].s - a[j].s)
        return true;

    return false;
}
void solve(int tc){
    int n;
    cin >> n; 

    a.resize(n);
    for(int i = 0; i < n; i++)
        cin >> a[i].f >> a[i].s;

    stack<int> r;
    r.push(0); 
    for(int i = 1; i < n; i++){
        if(covers(r.top(), i)) continue;

        while(!r.empty() && covers(i, r.top())) 
            r.pop();

        r.push(i);
    }

    cout << r.size() << '\n';
}


int main(){
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    #ifdef LOCAL
        auto begin = high_resolution_clock::now();
    #endif

    int tc = 1;
    // cin >> tc; 
    for (int t = 0; t < tc; t++) solve(t);
    
    #ifdef LOCAL 
        auto end = high_resolution_clock::now();
        cout << fixed << setprecision(4) << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
    #endif
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1730 ms 115952 KB Output is correct
2 Correct 1693 ms 115608 KB Output is correct
3 Correct 1655 ms 112624 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 42 ms 1772 KB Output is correct
15 Correct 44 ms 1900 KB Output is correct
16 Correct 44 ms 2156 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1740 ms 103840 KB Output is correct
2 Correct 1780 ms 200096 KB Output is correct
3 Correct 1726 ms 195344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1730 ms 115952 KB Output is correct
2 Correct 1693 ms 115608 KB Output is correct
3 Correct 1655 ms 112624 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 42 ms 1772 KB Output is correct
18 Correct 44 ms 1900 KB Output is correct
19 Correct 44 ms 2156 KB Output is correct
20 Correct 1740 ms 103840 KB Output is correct
21 Correct 1780 ms 200096 KB Output is correct
22 Correct 1726 ms 195344 KB Output is correct
23 Execution timed out 2075 ms 247036 KB Time limit exceeded
24 Halted 0 ms 0 KB -