# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
723949 | _martynas | Love Polygon (BOI18_polygon) | C++11 | 137 ms | 26740 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;
#define F first
#define S second
#define PB push_back
#define all(a) (a).begin(), (a).end()
using pii = pair<int, int>;
using vi = vector<int>;
const int MXN = 1e5+5;
int n;
string A[MXN], B[MXN];
vector<string> names;
int to[MXN];
vi from[MXN];
bool visited[MXN], in_stack[MXN];
int cycle[MXN], id = 1; // id == 0 => not in a cycle
int dp[2][MXN]; // dp[0] don't take, dp[1] take
void recur(int u) {
if(from[u].empty()) {
dp[0][u] = 0, dp[1][u] = 1;
return;
}
int sum = 0;
for(int v : from[u]) {
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |