# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1001721 | concac | Bank (IZhO14_bank) | C++17 | 93 ms | 16852 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.
#include <bits/stdc++.h>
#include<unordered_map>
#define PI acos(-1.0)
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define endl "\n"
#define pb push_back
#define ff first
#define ss second
#define ins insert
#define pll2 pair<ll,pair<ll,ll>>
#define bit(i,k) ((k>>i)&1)
#define pii pair<int,int>
#define int long long
using namespace std;
const long long mod = 998244353;
const ll inf = 1e9;
const ll maxN = (1<<20)+5;
ll a[20],b[20];
pll dp[maxN];
void solve()
{
ll n,m;
cin>>n>>m;
dp[0]={-1,a[0]};
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<m;i++){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |