# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522236 | blue | Newspapers (CEOI21_newspapers) | C++17 | 35 ms | 4384 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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void answer(vector<int> res)
{
if((int)res.size() == 0)
{
cout << "NO\n";
}
else
{
cout << "YES\n";
cout << (int)res.size() << '\n';
for(int r:res) cout << r << ' ';
cout << '\n';
}
}
const int maxN = 1000;
const int INF = 1005;
int N, M;
vector<int> edge[1+maxN];
vector< vector<int> > dist(1+maxN, vector<int>(1+maxN, INF));
int ans = 0;
vector<int> visit;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |