| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1059718 | Cyanberry | Tropical Garden (IOI11_garden) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "gardenlib.h"
using namespace std;
void count_routes(int fountains, int pathCount, int dest, vector<vector<int>> paths, int groupCount, vector<int> groups) {
vector<vector<int>> graf(pathCount, vector<int>{});
for (int i = 0; i < paths.size(); ++i) {
graf[paths[i][0]].push_back(paths[i][1]);
graf[paths[i][1]].push_back(paths[i][0]);
}
vector<int> lengths(pathCount, 0);
for (int i = 0; i < pathCount; ++i) {
if (lengths[i] == 0) {
int counting = -1, curr = i, prev = -1, dist;
// cout<<'+'<<i<<'\n';
while (curr != dest) {
lengths[curr] = counting;
if (prev != graf[curr][0] || graf[curr].size() == 1) {
prev = curr;
curr = graf[curr][0];
} else {
prev = curr;
curr = graf[curr][1];
}
// cout<<counting<<'\n';
--counting;
if (lengths[curr] > 0) {
dist = lengths[curr] - counting + 1;
break;
}
if (lengths[curr] < 0 && lengths[curr] - counting > 2) {
dist = -1;
break;
}
if (curr == dest) {
dist = -counting;
break;
}
}
curr = i, prev = -1;
if (dist < 0) continue;
while (curr != dest) {
if (lengths[curr] < 0) lengths[curr] += dist;
if (prev != graf[curr][0] || graf[curr].size() == 1) {
prev = curr;
curr = graf[curr][0];
} else {
prev = curr;
lengths[curr] += 2;
curr = graf[curr][1];
}
if (lengths[curr] > 0) {
break;
}
if (curr == dest) {
break;
}
}
}
}
int counting = 0, curr = dest, prev = -1;
while (true) {
if (prev != graf[curr][0] || graf[curr].size() == 1) {
prev = curr;
curr = graf[curr][0];
} else {
prev = curr;
curr = graf[curr][1];
}
++counting;
if (curr == dest) {
break;
}
}
vector<int> answers(150010, 0);
for (int i = 0; i < lengths.size(); ++i) {
if (lengths[i] > 0) ++answers[lengths[i]];
}
for (int i = 0; i < counting; ++i) {
for (int j = i; j < 150010; j += counting) {
if (j > i) {
answers[j] += answers[j - counting];
}
}
}
for (int i : groups) {
if (i < 150010) answer(answers[i]);
else {
i -= 150010;
i %= counting;
i -= counting;
i += 150010;
answer(answers[i]);
}
}
}