# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
674138 | QwertyPi | Shell (info1cup18_shell) | C++14 | 426 ms | 88540 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 int long long
#define fi first
#define se second
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 1e6 + 11;
vector<int> G[MAXN];
bool vis[MAXN];
vector<int> tp;
int n, m, p;
void dfs(int v){
vis[v] = true;
for(auto i : G[v]){
if(!vis[i]) dfs(i);
}
tp.push_back(v);
}
int dp[MAXN], to[MAXN];
int32_t main(){
cin.tie(0); cout.tie(0)->sync_with_stdio(false);
cin >> n >> m >> p;
vector<int> v; v.push_back(1);
for(int i = 0; i < p; i++){
int k; cin >> k;
if(k == 1){
if(i == 0 || v.size() == 1) continue;
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... |