# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107059 | Pajaraja | Pipes (BOI13_pipes) | C++17 | 389 ms | 24436 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 MAXN 100007
#define MAXM 500007
using namespace std;
map<pair<int,int>,long long> mp;
vector<int> g[MAXN],c;
int gr[MAXM][2],n,m,deg[MAXN],parc[MAXN];
long long t[MAXN];
bool vi[MAXN];
void dfs(int s)
{
c.push_back(s);
vi[s]=true;
for(int i=0;i<g[s].size();i++) if(!vi[g[s][i]]) dfs(g[s][i]);
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%lld",&t[i]);
for(int i=0;i<m;i++)
{
scanf("%d%d",&gr[i][0],&gr[i][1]);
g[gr[i][0]].push_back(gr[i][1]);
g[gr[i][1]].push_back(gr[i][0]);
}
queue<int> q;
for(int i=1;i<=n;i++) deg[i]=g[i].size();
for(int i=1;i<=n;i++) if(deg[i]==1) q.push(i);
while(!q.empty())
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |