/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 1ms 540.0 KiB
#3 Accepted 1ms 540.0 KiB
#4 Accepted 1ms 540.0 KiB
#5 Accepted 2ms 328.0 KiB
#6 Wrong Answer 2ms 520.0 KiB
#7 Accepted 2ms 540.0 KiB
#8 Accepted 1ms 540.0 KiB
#9 Wrong Answer 2ms 496.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define all(v) v.begin(),v.end()
#define nl "\n"
#define FIO \
    ios_base::sync_with_stdio(false);\
    cin.tie(NULL);\
    cout.tie(NULL);

void solve()
{
    ll n; cin >> n;
    vector<pair<ll,ll>>v(n);
    for(ll i=0;i<n;i++)
    {
        cin>>v[i].first>>v[i].second;
    }
    ll x,y; cin>>x>>y;
    bool up=false;
    for(ll i=0;i<n;i++)
    {
        if(v[i].second>=y)  up=true;
    }
    bool down=false;
    for(ll i=0;i<n;i++)
    {
        if(y>=v[i].second)  down=true;
    }
    bool left=false;
    for(ll i=0;i<n;i++)
    {
        if(x>=v[i].first)   left=true;
    }
    bool right=false;
    for(ll i=0;i<n;i++)
    {
        if(x<=v[i].first)   right=true;
    }
    if(up && down && left && right) cout<<"YES\n";
    else cout<<"NO\n";
}

int32_t main()
{
 FIO
    ll t=1;
    // cin>>t;
    for(ll i=1;i<=t;i++)
    {
        // cout<<"Case "<<i<<": ";
        solve();
    }
}

Information

Submit By
Type
Submission
Problem
P1145 Nobita's Love for Shizuka
Contest
LU IUJPC : Sylhet Division 2024
Language
C++17 (G++ 13.2.0)
Submit At
2024-12-09 09:33:50
Judged At
2024-12-09 09:33:50
Judged By
Score
24
Total Time
2ms
Peak Memory
540.0 KiB