# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99671 | 2019-03-06T05:18:23 Z | adlet | Calvinball championship (CEOI15_teams) | C++17 | 1000 ms | 384 KB |
#include <bits/stdc++.h> #define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout) #define ios ios_base::sync_with_stdio(0), cin.tie(0) using namespace std; typedef long long ll; const int N = 1e5 + 5; const int mod = 1e6 + 7; const int INF = 1e9; const double PI = acos(-1.0); vector < int > vec; int n, a[20], cnt; ll res = 1; void rec(int i, int mx = 1, int ok = -1) { if (i == n + 1) { ++cnt; if (cnt >= mod) cnt -= mod; // for (int i : vec) // cout << i << " "; // cout << "\n"; if (!ok) return; cout << cnt; exit(0); } for (int j = 1; j <= min(i, mx + 1); ++j) { vec.push_back(j); rec(i + 1, max(j, mx), (j != a[i]) ? 0 : ok); vec.pop_back(); } } int main() { scanf("%d", &n); for (int i = 1; i <= n; ++i) { scanf("%d", a + i); res = (res * 1ll * a[i]) % mod; } // if (n <= 14) { rec(1); return 0; // } } /** clock() / (double)CLOCKS_PER_SEC < 1.9 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 128 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Correct | 2 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 114 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Execution timed out | 1076 ms | 384 KB | Time limit exceeded |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1065 ms | 384 KB | Time limit exceeded |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1076 ms | 256 KB | Time limit exceeded |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |