oj.uz

답안 #516549

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
516549 2022-01-21T13:05:05 Z DJ035 Furniture (JOI20_furniture) C++17
0 / 100
 5000 ms 10404 KB 
# pragma GCC optimize ("O3")
# pragma GCC optimize ("Ofast")
# pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
#define MEM 1111
#define sanic ios_base::sync_with_stdio(0)
#define x first
#define y second
#define pf push_front
#define pb push_back
#define all(v) v.begin(), v.end()
#define sz size()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
const ll MOD = 1e9+7;
const ll INF = 2e14+7;
ll mul(ll a, ll b){
    return ((a*b)%MOD+MOD)%MOD;
}
ll add(ll a, ll b){
    return ((a+b)%MOD+MOD)%MOD;
}
 
ll t,n,m,k;
ll a[MEM][MEM], v[MEM][MEM];
string s;
queue<pi> q;
ll bfs(){
    memset(v, 0, sizeof(v));
    pi fin={n-1, m-1};
    q.push({0,0});
    while(!q.empty()){
        pi cur = q.front();
        q.pop();
        if(cur==fin)
            return 1;
        //cout << "c " << cur.x << ' ' << cur.y << '\n';
        if(!v[cur.x+1][cur.y] && !a[cur.x+1][cur.y] && (cur.x+1<n && cur.y<m)){
            v[cur.x+1][cur.y] = 1;
            q.push({cur.x+1, cur.y});
        }
        if(!v[cur.x][cur.y+1] && !a[cur.x][cur.y+1] && (cur.x<n && cur.y+1<m)){
            v[cur.x][cur.y+1] = 1;
            q.push({cur.x, cur.y+1});
        }
    }
    return 0;
}
signed main(){
    //sanic; cin.tie(0); cout.tie(0);
    scanf("%lld %lld ", &n, &m);
    for(int i=0; i<n; i++)
        for(int j=0; j<m; j++)
            scanf("%lld ", &a[i][j]);
    scanf("%lld ", &t);
     ll q1,q2;
    while(t--){
        scanf("%lld %lld ", &q1, &q2);
        if(a[q1-1][q2-1]){
            puts("0");
            continue;
        }
        a[q1-1][q2-1] = 1;
        ll f=bfs();
        if(f) puts("1");
        else {
            puts("0");
            a[q1-1][q2-1] = 0;
        }
    }
}

Compilation message

furniture.cpp: In function 'int main()':
furniture.cpp:52:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |     scanf("%lld %lld ", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
furniture.cpp:55:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |             scanf("%lld ", &a[i][j]);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~
furniture.cpp:56:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |     scanf("%lld ", &t);
      |     ~~~~~^~~~~~~~~~~~~
furniture.cpp:59:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |         scanf("%lld %lld ", &q1, &q2);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 403 ms 10308 KB Output is correct
2 Correct 2626 ms 10384 KB Output is correct
3 Correct 3173 ms 10384 KB Output is correct
4 Execution timed out 5081 ms 10404 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Correct 403 ms 10308 KB Output is correct
2 Correct 2626 ms 10384 KB Output is correct
3 Correct 3173 ms 10384 KB Output is correct
4 Execution timed out 5081 ms 10404 KB Time limit exceeded
5 Halted 0 ms 0 KB -