oj.uz

답안 #387289

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
387289 2021-04-08T08:42:59 Z Carmel_Ab1 Trampoline (info1cup20_trampoline) C++17
0 / 100
 1330 ms 64212 KB 
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define gcd __gcd
#define popcount __builtin_popcountll
#define mp make_pair

template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}
ll ceil(ll a,ll b){
    ll ans=a/b;
    if(a%b)ans++;
    return ans;
}
ld log (ld a,ld b){return log(b)/log(a);}
ll power(ll base, ll exp,ll M=1e9+7){//(base^exp)%M
    ll ans=1;
    while(exp){
        if(exp%2==1)ans=((ans%M)*(base%M))%M;
        base=((base%M)*(base%M))%M;
        exp/=2;
    }
    return ans;
}

string to_base(int n,int new_base){
    string s;
    int nn=n;
    while(nn){
        s+=to_string(nn%new_base);
        nn/=new_base;
    }
    reverse(all(s));
    return s;
}

ll lcm(ll a,ll b){
    ll x= (a/gcd(a,b));
    return b*x;
}
vl generate_array(ll n,ll mn=1,ll mx=1e18+1,bool permuatation=0){
    if(permuatation){
        vl a(n);
        for(int i=0; i<n; i++)
            a[i]=i+1;
        random_shuffle(all(a));
        return a;
    }
    if(mx==1e18+1)
        mx=n;
    vl ans(n);
    for(int i=0; i<n;i++)
        ans[i]=(mn+rand()%(mx-mn+1));
    return ans;
}
string substr(string s,int l,int r){
    string ans;
    for(int i=l; i<=r; i++)
        ans+=s[i];
    return ans;
}


void solve();
int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}

void solve(){
    ll r,c,n;
    cin >> r >>  c >> n;
    map<pl,pl>nxt;
    map<ll,set<ll>>who;//who in row i

    vpl a;
    for(int i=0; i<n; i++){
        int x,y;
        cin >> x >> y;
        who[x].insert(y);
        a.push_back({x,y});
    }
    for(int i=0; i<n; i++){
        nxt[a[i]]={-1,-1};
        if(who[a[i].first+1].lower_bound(a[i].second)!=who[a[i].first+1].end())
            nxt[a[i]]={a[i].first+1,*who[a[i].first+1].lower_bound(a[i].second)};
    }
    sort(all(a),[](pl p1,pl p2){return p1.first>p2.first;});
    map<pl,pl>lst;
    map<pl,pl>first;
    for(int i=0; i<n; i++){
        if(nxt[a[i]].first==-1)
            lst[a[i]]=a[i];
        else
            lst[a[i]]=lst[nxt[a[i]]];
    }


    ll q;
    cin >> q;
    while(q--){
        ll i1,j1,i2 ,j2;
        cin >> i1 >> j1 >> i2 >> j2;
        if(i2==i1){cout << "Yes\n";continue;}
        if(who[i1].lower_bound(j1)==who[i1].end()){cout << "No\n";continue;}
        j1=*who[i1].lower_bound(j1);
        if(lst[{i1,j1}].first>=i2)cout << "Yes\n";
        else cout << "No\n";
    }
}

Compilation message

trampoline.cpp: In function 'void usaco(std::string)':
trampoline.cpp:40:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   40 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
trampoline.cpp:41:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   41 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 2408 KB expected NO, found YES [2nd token]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 754 ms 46428 KB expected NO, found YES [121st token]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1330 ms 56788 KB expected NO, found YES [1st token]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 1772 KB expected NO, found YES [2nd token]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1329 ms 64212 KB expected NO, found YES [12th token]
2 Halted 0 ms 0 KB -