# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1014851 | ByeWorld | Dango Maker (JOI18_dango_maker) | C++14 | 328 ms | 262144 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>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
// #define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<int, pii> ipii;
const int MAXN = 3002;
int n, m;
char a[MAXN][MAXN];
int b[MAXN][MAXN], cnt;
vector <vector<int>> adj;
void add(int x, int y){ adj[y].pb(x); }
int day;
vector <int> mat, vis;
vector<bool> done;
bool dfs(int nw){
if(vis[nw] == day) return 0;
vis[nw] = day;
for(auto nx : adj[nw]){
if(mat[nx]==0 || dfs(mat[nx])){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |