# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
635834 | K4YAN | Liteh and Newfiteh (INOI20_litehfiteh) | C++17 | 506 ms | 270400 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//Be Name Khoda
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pll pair<ll, ll>
#define all(x) x.begin(), x.end()
const ll mxn = 1e5 + 16, lg = 18, INF = 1e16 + 16;
ll n, q, w, e;
ll dp[mxn], mn[mxn][lg], pd[mxn][lg][lg];
vector<ll> g;
bool bomb;
inline void input() {
for(int i = 0; i < mxn; i++) {
dp[i] = INF;
for(int j = 0; j < lg; j++) {
mn[i][j] = INF;
fill(pd[i][j], pd[i][j] + lg, INF);
}
}
cin >> n;
for(int i = 0; i < n; i++) {
cin >> q;
g.push_back(q);
if(q >= lg) bomb = 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |