# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
349000 | blue | Paths (BOI18_paths) | C++17 | 722 ms | 52076 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 <vector>
using namespace std;
int main()
{
int N, M, K;
cin >> N >> M >> K;
vector<int> col(N+1);
for(int i = 1; i <= N; i++)
{
cin >> col[i];
col[i] = (1 << (col[i] - 1));
}
vector<int> edge[N+1];
int a, b;
for(int i = 1; i <= M; i++)
{
cin >> a >> b;
edge[a].push_back(b);
edge[b].push_back(a);
}
vector<int> count1(33);
count1[0] = 0;
for(int i = 1; i <= 32; i++) count1[i] = count1[i/2] + (i % 2);
# | 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... |