oj.uz

Submission #365951

# Submission time Handle Problem Language Result Execution time Memory
365951 2021-02-12T15:07:58 Z soba Trampoline (info1cup20_trampoline) C++14
43 / 100
 218 ms 49388 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main()
{
    ll r , c , n , x , y , a, b, t;
    cin >> r>> c >> n ;
    int next[r+1][c+1] , grid[r+1][c+1]={0};
    for(int i = 0 ; i < n ; i++)
    {
        cin >> x>> y ;
        grid[x][y]=1;
    }
    for(int i = 1 ; i <= r ; i++)
    {
        x=c+1;
        for(int j = c; j>=1 ; j--)
        {
            if(grid[i][j])x=j;
            next[i][j]=x;
        }
    }
//    for(int i = 1 ; i <= r ; i++)
//    {
//        x=c+1;
//        for(int j = 1; j<=c ; j++)
//        {
//            cout << next[i][j]<< " ";
//        }
//        cout << "\n";
//    }
    cin >> t;
    while(t--)
    {
        cin>> x >> y >> a >> b ;
        if(x==a)
        {
            if(y<=b)
            {
                cout << "Yes\n";
            }
            else cout << "No\n";
            continue;
        }
        int j=y;
        int impos=1;
        for(int i = x ; i<a ; i++)
        {
            j=next[i][j];
            if(j>b)
            {
                impos=1;
                break;
            }
            if(i==a-1)
            {
                impos=0;
            }
        }
        if(impos)
        {
            cout << "No\n";
        }
        else cout << "Yes\n";
    }
    return 0;
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 620 KB 200 token(s): yes count is 21, no count is 179
2 Correct 5 ms 492 KB 200 token(s): yes count is 70, no count is 130
3 Correct 4 ms 620 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 174 ms 49208 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 180 ms 49388 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 112 ms 2156 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 218 ms 49260 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 492 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 492 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 492 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -