# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
312457 | colazcy | Džumbus (COCI19_dzumbus) | C++17 | 77 ms | 22264 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 <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn = 1e3 + 100;
typedef long long ll;
inline int read(){
int x = 0;char c = getchar();
while(!isdigit(c))c = getchar();
while(isdigit(c))x = x * 10 + c - '0',c = getchar();
return x;
}
int n,m,val[maxn],vis[maxn],siz[maxn];
vector<int> G[maxn];
inline void addedge(int u,int v){G[u].push_back(v);}
int f[maxn][maxn][2][2],ans[maxn];
template <typename A,typename B>
inline void chk(A &a,B b){
if(b >= 0x3f3f3f3f)b = 0x3f3f3f3f;
if(b < a)a = b;
}
inline void dfs(int u){
siz[u] = 1;
vis[u] = 1;
f[u][0][1][0] = val[u];
f[u][0][0][0] = 0;
for(int i = 0;i < G[u].size();i++){
int v = G[u][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... |