oj.uz

답안 #921823

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921823 2024-02-04T11:01:14 Z vjudge1 Lightning Rod (NOI18_lightningrod) C++17
11 / 100
 2000 ms 156252 KB 
#include <bits/stdc++.h>
#include <iomanip>
#define ll long long
//#define int long long
#define pb push_back
#define F first
#define S second
#define st string
#define pii pair<int,int>
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define mii map<int,int>
#define mll map<ll,ll>
#define YES cout<<"YES\n";
#define NO cout<<"NO\n";
#define yes cout<<"Yes\n";
#define no cout<<"No\n";
#define lf else if 
using namespace std;
signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    //srand( time(0));
    //freopen("sum.in", "r", stdin);
    //freopen("sum.out", "w", stdout);
    ll tests=1;
    //cin>>tests;
    for(ll i=1;i<=tests;i++)
    {
        //cout<<"Case "<<i<<":\n";
        ll n,mx=0,mn=10;
        cin>>n;
        vector <pair <ll,ll> > v(n);
        for(ll i=0;i<n;i++)
        {
            cin>>v[i].S>>v[i].F;
            mx=max(mx,v[i].F);
            mn=min(mn,v[i].F);
        }
        ll ans=n,an=n;
        if(mx==1 && mn==1){cout<<n;return 0;}
        sort(v.begin(),v.end());
        for(ll i=0;i<n;i++)
        {
            for(ll j=0;j<n;j++)
            {
                if(abs(v[i].S-v[j].S)<=v[i].F-v[j].F && i!=j)an--;
            }
        }
        cout<<an;
    }
}

Compilation message

lightningrod.cpp: In function 'int main()':
lightningrod.cpp:40:12: warning: unused variable 'ans' [-Wunused-variable]
   40 |         ll ans=n,an=n;
      |            ^~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1063 ms 154964 KB Output is correct
2 Correct 1087 ms 153212 KB Output is correct
3 Correct 1050 ms 147640 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 392 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 392 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 392 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 392 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2040 ms 156252 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1063 ms 154964 KB Output is correct
2 Correct 1087 ms 153212 KB Output is correct
3 Correct 1050 ms 147640 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 392 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -