# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1156948 | SmuggingSpun | Magic Tree (CEOI19_magictree) | C++20 | 1634 ms | 175176 KiB |
#include<bits/stdc++.h>
#define taskname "B"
using namespace std;
typedef long long ll;
template<class T>void maximize(T& a, T b){
if(a < b){
a = b;
}
}
const int lim = 1e5 + 5;
int n, m, k, parent[lim], vertex[lim], day[lim], weight[lim];
vector<int>g[lim];
namespace sub1{
void solve(){
vector<int>low(n + 1), tail(n + 1);
int euler = -1;
auto dfs = [&] (auto&& self, int s) -> void{
low[s] = ++euler;
for(int& d : g[s]){
self(self, d);
}
tail[s] = euler;
};
dfs(dfs, 1);
vector<pair<int, int>>fruit(n, make_pair(-1, 0));
for(int i = 1; i <= m; i++){
fruit[low[vertex[i]]] = make_pair(day[i] - 1, weight[i]);
}
vector<vector<ll>>f(k, vector<ll>(1 << n, -1));
auto dp = [&] (auto&& self, int p, int mask) -> ll{
컴파일 시 표준 에러 (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... |
# | 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... |