# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
556909 | 2022-05-04T10:52:49 Z | Itamar | Bootfall (IZhO17_bootfall) | C++14 | 45 ms | 122580 KB |
#include <map> #include <iostream> using namespace std; #include <vector> #include <queue> #include <set> #include <algorithm> #define ll long long #define vi vector<int> #define vll vector<ll> #define pi pair<int,int> #define pll pair<ll,ll> const int siz = 500; int a[siz]; bool dp[siz * siz][siz]; int uni[siz * siz]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { int ai; cin >> ai; a[i] = ai; } for (int i = 0; i < siz; i++) dp[0][i] = 1; for (int i = 1; i < siz * siz; i++) { for (int j = 0; j < siz; j++) { dp[i][j]++; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 45 ms | 122580 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 45 ms | 122580 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 45 ms | 122580 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 45 ms | 122580 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 45 ms | 122580 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 45 ms | 122580 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |