# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
697173 | bin9638 | Raspad (COI17_raspad) | C++17 | 6101 ms | 48460 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 N 100010
#define ll long long
#define ii pair<int,int>
#define fs first
#define sc second
#define pb push_back
#define iii pair<int,ii>
#define int ll
int f[N],a[N][55],n,m;
struct haha
{
int val=0,sum=0,sl=0,cnt[55]={},id[55]={},ktr[55]={};
int get(int mod)
{
int res=0;
for(int i=1;i<=m;i++)
res=(res+f[i]%mod*id[i])%mod;
return res;
}
void DFS(int u,int dem,int h)
{
ktr[u]=dem;
if(ktr[u-1]==0&&a[h][u-1]==1)
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... |