oj.uz

Submission #516302

# Submission time Handle Problem Language Result Execution time Memory
516302 2022-01-21T04:42:12 Z jk410 Furniture (JOI20_furniture) C++17
5 / 100
 1989 ms 760 KB 
#include <bits/stdc++.h>
using namespace std;
struct pos{
    int x,y;
};
int N,M,Q;
int A[101][101];
int dx[2]={0,1},dy[2]={1,0};
bool Visited[101][101];
bool f(){
    for (int i=1; i<=N; i++){
        for (int j=1; j<=M; j++)
            Visited[i][j]=false;
    }
    queue<pos> q;
    Visited[1][1]=true;
    q.push({1,1});
    while (!q.empty()){
        pos t=q.front();
        q.pop();
        for (int i=0; i<2; i++){
            int x=t.x+dx[i],y=t.y+dy[i];
            if (x>N||y>M||Visited[x][y]||A[x][y])
                continue;
            Visited[x][y]=true;
            q.push({x,y});
        }
    }
    return Visited[N][M];
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>N>>M;
    for (int i=1; i<=N; i++){
        for (int j=1; j<=M; j++)
            cin>>A[i][j];
    }
    cin>>Q;
    while (Q--){
        int x,y;
        cin>>x>>y;
        A[x][y]=1;
        if (!f()){
            cout<<"0\n";
            A[x][y]=0;
        }
        else
            cout<<"1\n";
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 332 KB Output is correct
2 Correct 27 ms 388 KB Output is correct
3 Correct 117 ms 384 KB Output is correct
4 Correct 178 ms 408 KB Output is correct
5 Correct 200 ms 332 KB Output is correct
6 Correct 356 ms 424 KB Output is correct
7 Correct 120 ms 436 KB Output is correct
8 Correct 183 ms 432 KB Output is correct
9 Correct 485 ms 456 KB Output is correct

Subtask #2
0.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 332 KB Output is correct
2 Correct 27 ms 388 KB Output is correct
3 Correct 117 ms 384 KB Output is correct
4 Correct 178 ms 408 KB Output is correct
5 Correct 200 ms 332 KB Output is correct
6 Correct 356 ms 424 KB Output is correct
7 Correct 120 ms 436 KB Output is correct
8 Correct 183 ms 432 KB Output is correct
9 Correct 485 ms 456 KB Output is correct
10 Incorrect 1989 ms 760 KB Output isn't correct
11 Halted 0 ms 0 KB -