#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(Tree <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
// if(str == "input") {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// } else if(str != "") {
// freopen((str + ".in").c_str(), "r", stdin);
// freopen((str + ".out").c_str(), "w", stdout);
// }
}
const int inf = 1e9;
const long long mod = 1e9 + 7;
const int N = 1005;
bool vis[N][N];
int a[N][N];
int n, m, when[1005][1005];
pair<int, int> p[N][N];
int hs[N][N], dp[N][N];
bool don[N][N];
bool check() {
queue<pair<int, int>> q;
vector<pair<int, int>> pte;
vis[1][1] = true;
q.push({1, 1});
pte.emplace_back(1, 1);
int ok = 0;
while(!q.empty()) {
auto u = q.front();
q.pop();
int x = u.first, y = u.second;
if(x == n && y == m) {
ok = 1;
break;
}
if(x + 1 <= n && a[x + 1][y] == 0) {
if(!vis[x + 1][y]) {
vis[x + 1][y] = true;
pte.emplace_back(x + 1, y);
q.push({x + 1, y});
}
}
if(y + 1 <= m && a[x][y + 1] == 0) {
if(!vis[x][y + 1]) {
vis[x][y + 1] = true;
pte.emplace_back(x, y + 1);
q.push({x, y + 1});
}
}
}
for(auto i: pte) {
vis[i.first][i.second] = false;
}
return ok;
}
void solve_() {
cin >> n >> m;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
int q; cin >> q;
vector<pair<int, int>> qr;
for(int i = 1; i <= q; i++) {
int x, y; cin >> x >> y;
qr.emplace_back(x, y);
}
int lst = -1;
vector<int> to_del(q + 1);
while(true) {
int ina = lst + 1, inb = sz(qr) - 1, ans = -1, mn = lst + 1;
while(ina <= inb) {
int mid = (ina + inb) / 2;
for(int i = mn; i <= mid; i++) {
a[qr[i].first][qr[i].second] = 1;
}
if(!check()) {
ans = mid;
inb = mid - 1;
} else {
mn = mid + 1;
ina = mid + 1;
}
for(int i = mn; i <= mid; i++) {
a[qr[i].first][qr[i].second] = 0;
}
}
if(ans == -1) {
break;
}
to_del[ans] = true;
for(int i = lst + 1; i < ans; i++) {
a[qr[i].first][qr[i].second] = 1;
}
lst = ans;
}
for(int i = 0; i < q; i++) {
int x = qr[i].first, y = qr[i].second;
if(to_del[i]) {
cout << 0 << '\n';
} else {
cout << 1 << '\n';
}
}
}
int main() {
setIO();
auto solve = [&](int test_case)-> void {
for(int i = 1; i <= test_case; i++) {
solve_();
}
};
int test_cases = 1;
// cin >> test_cases;
solve(test_cases);
return 0;
}
Compilation message
furniture.cpp: In function 'void solve_()':
furniture.cpp:190:9: warning: unused variable 'x' [-Wunused-variable]
190 | int x = qr[i].first, y = qr[i].second;
| ^
furniture.cpp:190:26: warning: unused variable 'y' [-Wunused-variable]
190 | int x = qr[i].first, y = qr[i].second;
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
724 KB |
Output is correct |
| 2 |
Correct |
4 ms |
852 KB |
Output is correct |
| 3 |
Correct |
5 ms |
852 KB |
Output is correct |
| 4 |
Correct |
9 ms |
980 KB |
Output is correct |
| 5 |
Correct |
8 ms |
980 KB |
Output is correct |
| 6 |
Correct |
11 ms |
980 KB |
Output is correct |
| 7 |
Correct |
17 ms |
1228 KB |
Output is correct |
| 8 |
Correct |
22 ms |
1168 KB |
Output is correct |
| 9 |
Correct |
61 ms |
1228 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
724 KB |
Output is correct |
| 2 |
Correct |
4 ms |
852 KB |
Output is correct |
| 3 |
Correct |
5 ms |
852 KB |
Output is correct |
| 4 |
Correct |
9 ms |
980 KB |
Output is correct |
| 5 |
Correct |
8 ms |
980 KB |
Output is correct |
| 6 |
Correct |
11 ms |
980 KB |
Output is correct |
| 7 |
Correct |
17 ms |
1228 KB |
Output is correct |
| 8 |
Correct |
22 ms |
1168 KB |
Output is correct |
| 9 |
Correct |
61 ms |
1228 KB |
Output is correct |
| 10 |
Correct |
560 ms |
1472 KB |
Output is correct |
| 11 |
Correct |
14 ms |
796 KB |
Output is correct |
| 12 |
Correct |
371 ms |
14580 KB |
Output is correct |
| 13 |
Correct |
212 ms |
18104 KB |
Output is correct |
| 14 |
Correct |
2442 ms |
22508 KB |
Output is correct |
| 15 |
Correct |
2513 ms |
20488 KB |
Output is correct |
| 16 |
Execution timed out |
5041 ms |
31208 KB |
Time limit exceeded |
| 17 |
Halted |
0 ms |
0 KB |
- |
