oj.uz

답안 #219899

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
219899 2020-04-06T16:34:06 Z Sho10 Trampoline (info1cup20_trampoline) C++14
23 / 100
 2000 ms 99448 KB 
/*
ID: Sho10
LANG: C++
*/
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,m,q,t,a[2505][2505],x,y,val,viz[2505][2505];
int32_t main(){
CODE_START;
cin>>n>>m>>val;
for(ll i=0;i<val;i++)
{
    cin>>x>>y;
    a[x][y]=1;
}
ll xx,yy,xs,ys;
cin>>t;
while(t--){
    cin>>xs>>ys>>xx>>yy;
    queue<ll>q1;
    queue<ll>q2;
    q1.push(xs);
    q2.push(ys);
    for(ll i=1;i<=2500;i++)
        for(ll j=1;j<=2500;j++){
        viz[i][j]=0;
        }
    viz[xs][ys]=1;
    while(!q1.empty()){
        x=q1.front();
        y=q2.front();
        if(a[x][y]==1){
            if(y+1<=m){
                if(viz[x][y+1]==0){
                    q1.push(x);
                    q2.push(y+1);
                    viz[x][y+1]=1;
                }
                }
                if(x+1<=n){
                    if(viz[x+1][y]==0){
                        q1.push(x+1);
                        q2.push(y);
                        viz[x+1][y]=1;
                    }
                }
        }else {
            if(y+1<=m){
        if(viz[x][y+1]==0){
            q1.push(x);
            q2.push(y+1);
            viz[x][y+1]=1;
        }
            }
    }
    if(x==xx&&y==yy){
            break;
        }
   q2.pop();
    q1.pop();
}
if(viz[xx][yy]==1){
    cout<<"Yes"<<endl;
}else cout<<"No"<<endl;
}
}

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1172 ms 50680 KB 200 token(s): yes count is 21, no count is 179
2 Correct 1196 ms 50424 KB 200 token(s): yes count is 70, no count is 130
3 Correct 1150 ms 50680 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
0 / 20.0

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

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 12 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 9 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 9 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -