oj.uz

Submission #520508

# Submission time Handle Problem Language Result Execution time Memory
520508 2022-01-30T08:04:42 Z sktlzz Trampoline (info1cup20_trampoline) C++17
73 / 100
 2000 ms 4200 KB 
#include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x<<' '<< x <<'\n'
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;i<n;i++)
#define ro(i,n) for(i=n;i<=0;i--)
#define Ro(i,k,n) for(i=k;i<n;i--)
#define ll long long
#define pll pair<ll,ll>
#define tll tuple<ll, ll, ll>
#define vl vector<ll>
#define vpll vector<pll>
#define pb push_back
#define MEMINF 0x3f // ll 456e16, int 11e8
#define MEMINFB 0x7f // ll 919e16, int 21e8
#define MEMINFN 0x80 // ll -810e16, int -19e8
#define INF LLONG_MAX
#define MM <<" "<<
#define endl "\n"


int main(){
    ios;
    ll i,j,k,n,m,r,c,q;
    pll newpt;
    cin >> r >> c >>n;
    vpll v(n);
    fo(i,n){
         cin >> j >> k;
         v[i] = {j,k};
    }
    sort(v.begin(),v.end());
    cin >> q;
    fo(i,q){
        bool ans = true;
        ll x1,y1,x2,y2;
        cin >> x1 >> y1 >> x2 >> y2;
        if (x1 > x2 || (x1==x2 && y1 > y2) ) {ans = false;}
        else{
            pll cur = {x1,y1};
            while (cur.first < x2 ){
            newpt = *lower_bound(v.begin(),v.end(),cur);
            // cout << newpt.first MM newpt.second<<endl;
            if  (newpt.first > cur.first || newpt.second > y2 ) { ans = false; break;}
            else cur ={newpt.first+1,newpt.second};
            } 
        }
        if (ans) cout <<"Yes"<<endl;
        else cout <<"No" <<endl;
    }
}

Compilation message

trampoline.cpp: In function 'int main()':
trampoline.cpp:25:16: warning: unused variable 'm' [-Wunused-variable]
   25 |     ll i,j,k,n,m,r,c,q;
      |                ^

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB 200 token(s): yes count is 21, no count is 179
2 Correct 3 ms 448 KB 200 token(s): yes count is 70, no count is 130
3 Correct 3 ms 476 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 3404 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 62 ms 3452 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 187 ms 3440 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 223 ms 3436 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 4036 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 155 ms 4036 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 170 ms 4084 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 189 ms 4200 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 166 ms 4096 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 172 ms 4092 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 332 KB 5000 token(s): yes count is 3238, no count is 1762
2 Correct 8 ms 684 KB 5000 token(s): yes count is 3837, no count is 1163
3 Correct 5 ms 688 KB 5000 token(s): yes count is 4104, no count is 896
4 Correct 6 ms 616 KB 5000 token(s): yes count is 3934, no count is 1066
5 Correct 130 ms 708 KB 5000 token(s): yes count is 3384, no count is 1616
6 Correct 4 ms 580 KB 5000 token(s): yes count is 3390, no count is 1610

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2085 ms 3440 KB Time limit exceeded
2 Halted 0 ms 0 KB -