# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
376085 | eulerdesoja | Love Polygon (BOI18_polygon) | C++14 | 332 ms | 31596 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>
#include<fstream>
using namespace std;
#define ll long long
#define pb push_back
#define sz(x) int(x.size())
typedef pair<int,int>ii;
typedef vector<int> vi;
void setIO(string s) {
ios_base::sync_with_stdio(0); cin.tie(0);
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
const int mxn=1e5+5;
int n,dp[mxn][2],root[mxn];
map<string,int>mp;
string love[mxn][2];
vi g[mxn];
bool v[mxn];
void dfs(int i,int p){
int sum=0;
int ma=0;
for(int j:g[i])if(j!=p){
dfs(j,i);
sum+=dp[j][0];
ma=max(ma,dp[j][1]-dp[j][0]);
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... |