oj.uz

Submission #1071367

# Submission time Handle Problem Language Result Execution time Memory
1071367 2024-08-23T06:56:40 Z Plurm Cultivation (JOI17_cultivation) C++11
5 / 100
 2000 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

int r, c;
bitset<16> moveleft(bitset<16> mask) {
    mask[0] = mask[c] = mask[2 * c] = mask[3 * c] = false;
    return mask >> 1;
}
bitset<16> moveright(bitset<16> mask) {
    mask[c - 1] = mask[2 * c - 1] = mask[3 * c - 1] = mask[4 * c - 1] = false;
    return mask << 1;
}
bitset<16> moveup(bitset<16> mask) {
    for (int i = 0; i < c; i++)
        mask[i] = false;
    return mask >> c;
}
bitset<16> movedown(bitset<16> 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});
    }
    for (int ans = 0; ans < 10; ans++) {
        for (int mask = 0; mask < (1 << (2 * ans)); mask++) {
            bitset<16> state(0);
            for (auto p : pts) {
                state[(p.first - 1) * c + p.second - 1] = true;
            }
            for (int i = 0; i < ans; i++) {
                int dir1 = mask & (1 << (2 * i)) ? 1 : 0;
                int dir2 = mask & (1 << (2 * i + 1)) ? 1 : 0;
                int dir = dir1 * 2 + dir2;
                switch (dir) {
                case 0:
                    state |= moveleft(state);
                    break;
                case 1:
                    state |= moveright(state);
                    break;
                case 2:
                    state |= moveup(state);
                    break;
                case 3:
                    state |= movedown(state);
                    break;
                }
            }
            if (state.count() >= r * c) {
                cout << ans << endl;
                return 0;
            }
        }
    }
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:60:31: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   60 |             if (state.count() >= r * c) {
      |                 ~~~~~~~~~~~~~~^~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Incorrect 41 ms 348 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Incorrect 41 ms 348 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2036 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2036 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Incorrect 41 ms 348 KB Output isn't correct
18 Halted 0 ms 0 KB -