Submission #2198161
Source Code Expand
#include"bits/stdc++.h" using namespace std; const long long MOD = (long long)1e9 + 7; bool isOK(vector<vector<int>> x) { for (int i = 0; i < 3; i++) { for (int j = 0; j < 5; j++) { if (x[i][j] < x[i + 1][j] && x[i + 1][j] < x[i + 2][j]) { return false; } if (x[i][j] > x[i + 1][j] && x[i + 1][j] > x[i + 2][j]) { return false; } } } for (int i = 0; i < 5; i++) { for (int j = 0; j < 3; j++) { if (x[i][j] < x[i][j + 1] && x[i][j + 1] < x[i][j + 2]) { return false; } if (x[i][j] > x[i][j + 1] && x[i][j + 1] > x[i][j + 2]) { return false; } } } return true; } int main() { vector<vector<int>> x(5, vector<int>(5)); vector<bool> appear(26, false); vector<pair<int, int>> empty; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { cin >> x[i][j]; if (x[i][j] == 0) { empty.push_back({ i, j }); } else { appear[x[i][j]] = true; } } } if (empty.size() == 0) { cout << (isOK(x) ? 1 : 0) << endl; return 0; } vector<int> remained; for (int i = 1; i <= 25; i++) { if (!appear[i]) { remained.push_back(i); } } long long ans = 0; do { auto copy = x; for (int i = 0; i < remained.size(); i++) { copy[empty[i].first][empty[i].second] = remained[i]; } if (isOK(copy)) { ans++; } } while (next_permutation(remained.begin(), remained.end())); cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - 25個の整数 |
User | tokumini |
Language | C++14 (GCC 5.4.1) |
Score | 30 |
Code Size | 1815 Byte |
Status | TLE |
Exec Time | 5255 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 0 / 70 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt |
Subtask1 | sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, test-1-01.txt, test-1-02.txt, test-1-03.txt, test-1-04.txt, test-1-05.txt, test-1-06.txt, test-1-07.txt, test-1-08.txt, test-1-09.txt, test-1-10.txt, test-1-11.txt, test-1-12.txt, test-1-13.txt, test-1-14.txt, test-1-15.txt |
Subtask2 | sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, test-1-01.txt, test-1-02.txt, test-1-03.txt, test-1-04.txt, test-1-05.txt, test-1-06.txt, test-1-07.txt, test-1-08.txt, test-1-09.txt, test-1-10.txt, test-1-11.txt, test-1-12.txt, test-1-13.txt, test-1-14.txt, test-1-15.txt, test-2-01.txt, test-2-02.txt, test-2-03.txt, test-2-04.txt, test-2-05.txt, test-2-06.txt, test-2-07.txt, test-2-08.txt, test-2-09.txt, test-2-10.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample-01.txt | AC | 2 ms | 256 KB |
sample-02.txt | AC | 21 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |
sample-04.txt | AC | 1 ms | 256 KB |
test-1-01.txt | AC | 19 ms | 256 KB |
test-1-02.txt | AC | 1 ms | 256 KB |
test-1-03.txt | AC | 2 ms | 256 KB |
test-1-04.txt | AC | 4 ms | 256 KB |
test-1-05.txt | AC | 4 ms | 256 KB |
test-1-06.txt | AC | 20 ms | 256 KB |
test-1-07.txt | AC | 19 ms | 256 KB |
test-1-08.txt | AC | 20 ms | 256 KB |
test-1-09.txt | AC | 20 ms | 256 KB |
test-1-10.txt | AC | 1 ms | 256 KB |
test-1-11.txt | AC | 1 ms | 256 KB |
test-1-12.txt | AC | 20 ms | 256 KB |
test-1-13.txt | AC | 1 ms | 256 KB |
test-1-14.txt | AC | 20 ms | 256 KB |
test-1-15.txt | AC | 20 ms | 256 KB |
test-2-01.txt | TLE | 5255 ms | 256 KB |
test-2-02.txt | TLE | 5255 ms | 256 KB |
test-2-03.txt | TLE | 5255 ms | 256 KB |
test-2-04.txt | TLE | 5255 ms | 256 KB |
test-2-05.txt | TLE | 5255 ms | 256 KB |
test-2-06.txt | TLE | 5255 ms | 256 KB |
test-2-07.txt | TLE | 5255 ms | 256 KB |
test-2-08.txt | TLE | 5255 ms | 256 KB |
test-2-09.txt | TLE | 5255 ms | 256 KB |
test-2-10.txt | TLE | 5255 ms | 256 KB |