# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1071391 | 2024-08-23T07:07:16 Z | Plurm | Cultivation (JOI17_cultivation) | C++11 | 1 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; int r, c; bitset<1600> moveleft(bitset<1600> mask) { for (int i = 0; i < r; i++) mask[i * c] = false; return mask >> 1; } bitset<1600> moveright(bitset<1600> mask) { for (int i = 0; i < r; i++) mask[i * c + c - 1] = false; return mask << 1; } bitset<1600> moveup(bitset<1600> mask) { for (int i = 0; i < c; i++) mask[i] = false; return mask >> c; } bitset<1600> movedown(bitset<1600> mask) { for (int i = 0; i < c; i++) mask[(r - 1) * c + i] = false; return mask << c; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> r >> c; int n; cin >> n; vector<pair<int, int>> pts; for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; pts.push_back({x, y}); } bitset<1600> init(0); for (auto p : pts) { init[(p.first - 1) * c + p.second - 1] = true; } for (int ans = 0; ans <= 80; ans++) { for (int p = 0; p < c && p <= ans; p++) { for (int q = 0; q < c && q <= ans; q++) { for (int s = 0; s < r && r <= ans; s++) { int t = ans - p - q - s; if (t < 0 || t >= r) continue; auto state = init; int comm = max({p, q, s, t}); for (int _ = 0; _ < comm; _++) { if (_ < p) state |= moveleft(state); if (_ < s) state |= moveup(state); if (_ < q) state |= moveright(state); if (_ < t) state |= movedown(state); } if (state.count() >= r * c) { cout << ans << endl; return 0; } } } } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 348 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 348 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |