# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
781640 | Kritzan | Naboj (COCI22_naboj) | C++14 | 634 ms | 30136 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;
int n, m;
pair<int ,int> arr[500005];
vector<pair<int ,int> > v[200005];
int ways[200005];
bool vis[200005];
int pnt[200005];
stack<pair<int,int> > s;
queue<int> q;
int main() {
cin >> n >> m;
for(int i =1 ; i <= m; i++) {
int a, b;
cin >> a >> b;
arr[i] = {a, b};
v[a].push_back({b, i});
v[b].push_back({a, i});
pnt[a]++;
ways[a]++;
ways[b]++;
}
memset(vis, 0, sizeof(vis));
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... |