# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696677 | socpite | Šarenlist (COCI22_sarenlist) | C++17 | 37 ms | 332 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>
using namespace std;
#define f first
#define s second
typedef long long ll;
typedef long double ld;
const int mod = 1e9+7;
const int maxn = 65;
const ll inf = 1e18+5;
int n, m, k;
int _s, _t;
vector<int> edg[maxn];
vector<int> alle[maxn];
int vis[65];
ll pw[65];
vector<int> tr[maxn];
vector<pair<int, int>> g[maxn];
bool dfs(int x, int p, int id){
//cout << _s << " " << x << "\n";
if(x == _t)return 1;
for(auto v: g[x]){
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |