# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701676 | angelo_torres | Nice sequence (IZhO18_sequence) | C++17 | 1203 ms | 84624 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>
#define sz(v) (ll) v.size()
#define ff first
#define ss second
using namespace std;
typedef long long ll;
const ll mod = 998244353;
const ll N = 6e5 + 20;
ll sum(ll a,ll b){ return (a+b)%mod; }
ll mul(ll a,ll b){ return (a*b)%mod; }
ll res(ll a,ll b){ return (a-b+mod)%mod; }
int n,m,r[N];
vector<int> g[N];
bool c = 0;
void dfs(int v){
r[v] = 1;
for(auto u : g[v]){
if(r[u] == 1) c = 1;
if(!r[u]) dfs(u);
}
r[v] = 2;
}
bool go(int k){
c = 0;
for(int i = 0; i <= k; ++i){
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |