oj.uz

답안 #108768

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
108768 2019-05-01T17:33:50 Z Jatana Election Campaign (JOI15_election_campaign) C++17
100 / 100
 480 ms 82216 KB 
/*
                                                                                                     
                                             `-:://:::-                                             
                                           `//:-------:/:`                                          
                                          .+:--.......--:+`                                         
                                         `+:--..`````..--//`                                        
                                         .o:--..`` ``..--:o`                                        
                                         .o:--...```..---+/`                                        
                                       `/y+o/---....---:+o.                                         
                                   `...````-os+/:---:/+o/--.`                                       
              `-/+++++/:.      `...`       :h+d+oooo+/+-`   ...                                     
            `/++//:::://++-`....`         -.`//````````:`     `..`                                  
           `o+/::------://o/`           `-` -.          -`       `..`                               
 `---.-o/:./o/::-..``..-ЗАПУСКАЕМ      ..  ..            -`        `...       ``..``                
  `....o+:-++/:--.```..-://s.        `-`  .-              -`          `-o: .-//::::/:-`             
          `:s+/:--....-::/+s-`      .-   `-                -`           -///:--------:/:`           
           ./s+//:::::://oo-``..НЕЙРОННУЮ: СЕТЬ:::::::-`РАБОТЯГИ        `+:--........--:/`          
            .:ooo+++++osso-`    `.:-...`/` ./::-------:/:`   -`         :+--..``````.--:+:...-+:-`  
             `.-/+++++/+-.-`    -.   ``:so:/:--.......--:+`  `-```````o+/+--..`````..--:o/-..:s+:.  
                 ```````:``.. `-`     -` `+:--..`````..--/+-.../.`````..-o:--.......---/o.    `     
                        `:  `:-      -.  .o:--..`` ``..--:o`   `-`      `:o+:--------:+o-`          
                         `-`-...    ..   .o/--...```..--:+/`    `-`     `oy/so/////++o/.`           
                          -/`  `-` `- ``+s/o/:---...---:++.      `-`   .-../d://///:-.`             
                `.---..``-..-    .-/..`````-oo+/:::::/+o+-        `-``-`  `-.  ````                 
             `:++++/+++++-  ..``.-/:`      /y-:/++o++/:.`..`       ./.   `-                         
            -++/::::::://+/..:-``:` ..   `-.`  ```.```    `..`   `..`-` `-                          
       ``  -o//:--....-::/++` -.-`   `-`.-`                 `..`..`  `-.-                           
  -----ss+:++/:--.```..-://s.  /.     `::                    `-:.     ./`                           
  `````/:..+o/::-..``.--:/+s. ..-`   `-``-`                 ..` `-`  `-`-`                          
          `-s+/::-----::/+oo---``-` ..    .:-    ```      .-`     .-.-  `-`                         
           `:oo+//::://+os/..:`..-/:`      :y.-:::::::.`.-`        ./-`  `-`                        
            `./+oooooooo+/.`-    .-:...`.. .//:-------://`        `- `..` `:.                       
              ``.-::::-.``-/`  `-` `-  `oo:+:--.......--:/`      `-    `.:--h.``..```               
                          -.-`.-    .-   `+:--..`````..--//`    `-       /s-//::::::::.             
                         -` `/-      ..  .o:--..`` ``..--:o.```.-        `//:--------://`           
                        -` .-`.-`     -.`-o/--...```..--:+/.``-:....``:-.+:--....`...--:+`          
                       ..`-.   `-.   ``:os:o/:---...---:++.  `-     ``///+:-..``````.--:+-````-.`   
              `.:///////.-`      .:-..` -``-+o+/:::::/+o/.  `-         `:+:-..`````..--:o/:--/ys+-  
            `-++///////+o/. ``....`-.    :` `.:++++++/:.`  .-           -o/---......---/o.   `.`    
           `++//:-----::/+o:..`     .-`   :    ```````    .-           `+so+:--------:++-`          
  `````:-``:o/::-..`..--:/+o`         -.  `-             .-          `../../+o+////+o+:.`           
  -----syo/o+/:--.```..-://s.          .-` `-           .-        `...     ``-:////:-``             
       .` `/s//:--....-::/+s.            -. `-`        .-       `..`                                
           .+o+/:::--:://+s/-..`          .::+y  ```  .-     `..`                                   
            ./oo++////+oso-`   `....       :y-+:::::::/`   ...                                      
             `.:+oooooo/-`         `....-. .//:-------:/:-.`                                        
                ``...``                 /+:+:--.......--:+`                                         
                                         `+:--..`````..--//`                                        
                                         .o:--..`` ``..--:o`                                        
                                         .+/--...```..--:+/`                                        
                                         `-o/:---...---:++.                                         
                                          `-+o+/:---:/+o/.                                          
                                            `.:+oooo+/-.`                                           
                                               ``````                                               
*/
#define fast_allocator
#ifdef aimbot
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#endif

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <queue>
#include <ostream>
#include <istream>
#include <typeinfo>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <limits>
#include <fstream>
#include <array>
#include <list>
#include <bitset>
#include <functional>
#include <random>
#include <cstring>
#include <chrono>

#define random escape__from__random__aetuhoetnuhshe
#define mt make_tuple
#define x first
#define y second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define umap unordered_map
#define uset unordered_set
#define elif else if
#define len(v) ((int)v.size())
#define f(i, n) for (int i = 0; i < (n); i++)
#define rof(i, n) for (int i = ((n) - 1); i >= 0; i--)
#define apply(v, act) for (auto &x : v) { act; }
#define log(args...) {string s = #args;deque<string> deq;\
string buf = "";int bal = 0;for (char c : s) {\
if (c == '(' || c == '[' || c == '{') {bal++;\
} else if (c == ')' || c == ']' || c == '}') {\
bal--;} else {if (bal == 0) {if (c == ',') {\
deq.pb(buf);buf = "";} else {if (c != ' ') {\
buf += c;}}}}}if (!buf.empty()) {deq.pb(buf);}\
smart_io::precall_print();smart_io::_print(deq, args);}

inline int min(const int &x, const int &y) { return (((y-x)>>(32-1))&(x^y))^x; }
inline int max(const int &x, const int &y) { return (((y-x)>>(32-1))&(x^y))^y; }
inline long long min(const long long &x, const long long &y) { return (((y-x)>>(64-1))&(x^y))^x; }
inline long long max(const long long &x, const long long &y) { return (((y-x)>>(64-1))&(x^y))^y; }

#define print    \
smart_io::precall_print(); \
cout,

#define scan cin,

#ifdef fast_allocator
const int MAXMEM = 200 * 1000 * 1024;
char _memory[MAXMEM];
size_t _ptr = 0;
void* operator new(size_t _x) { _ptr += _x; assert(_ptr < MAXMEM); return _memory + _ptr - _x; }
void operator delete (void*) noexcept {}
#endif

using namespace std;

char string_in_buffer[(int)260];


void fast_scan(int &x) { scanf("%d", &x); }
void fast_scan(long long &x) { scanf("%lld", &x); }
void fast_scan(unsigned long long &x) { scanf("%llu", &x); }
void fast_scan(double &x) { scanf("%lf", &x); }
void fast_scan(long double &x) { scanf("%Lf", &x); }
void fast_scan(char &x) {
	scanf("%c", &x);
	if (x == '\n') {
		fast_scan(x);
	}
}
void fast_scan(string &x) {
	scanf("%s", string_in_buffer);
	x = string(string_in_buffer);
}

template<class TFirst, class TSecond>
void fast_scan(pair<TFirst, TSecond> &p) {
	fast_scan(p.first);
	fast_scan(p.second);
}

template <class T>
void fast_scan(vector<T> &v) {
	for (auto &x : v) fast_scan(x);
}

void fast_print(const int &x) { printf("%d", x); }
void fast_print(const unsigned int &x) { printf("%u", x); }
void fast_print(const long long &x) { printf("%lld", x); }
void fast_print(const unsigned long long &x) { printf("%llu", x); }
void fast_print(const double &x) { printf("%.15lf", x); }
void fast_print(const long double &x) { printf("%.15Lf", x); }
void fast_print(const char &x) { printf("%c", x); };
void fast_print(const string &x) { printf("%s", x.c_str());}
void fast_print(const char v[]) { fast_print((string)v); }

template<class TFirst, class TSecond>
void fast_print(const pair<TFirst, TSecond> &p) {
	fast_print(p.first);
	fast_print(' ');
	fast_print(p.second);
}

template <class T>
void fast_print(const vector<T> &v) {
	if (v.empty()) return;
	fast_print(v[0]);
	for (int i = 1; i < v.size(); i++) {
		fast_print(' ');
		fast_print(v[i]);
	}
}

template <class T>
void fast_print(const vector<vector<T>> &v) {
	if (v.empty()) return;
	fast_print(v[0]);
	for (int i = 1; i < v.size(); i++) {
		fast_print('\n');
		fast_print(v[i]);
	}
}

template <class T>
void fast_print(const T &v) {
	for (const auto &x : v) {
		fast_print(x);
		fast_print(' ');
	}
}


using namespace std;


namespace smart_io {
	string print_start = "";
	string sep = " ";
	bool first_print = false;
	
	void precall_print() {
		fast_print(print_start);
		print_start = "\n";
		first_print = true;
	}
	
	void _print(deque<string>) {}
	template<class T, class... Args>
	void _print(deque<string> names, T elem, Args... args) {
		if (!first_print) {
			fast_print("\n");
		} else {
			first_print = false;
		}
		fast_print(names.front());
		fast_print(" = ");
		fast_print(elem);
		names.pop_front();
		_print(names, args...);
	}
} //namespace smart_io


template <class T>
ostream &operator,(ostream &os, const T &object) {
	if (!smart_io::first_print) {
		fast_print(smart_io::sep);
	} else {
		smart_io::first_print = false;
	}
	fast_print(object);
	return os;
}

template <class T>
istream &operator,(istream &is, T &object) {
	fast_scan(object);
	return is;
}

namespace random {
	using namespace std::chrono;
	mt19937 rng(duration_cast< milliseconds >(
											  system_clock::now().time_since_epoch()
											  ).count());
	uniform_real_distribution<> prob_dist(0.0, 1.0);
};

namespace typedefs {
	typedef long long ll;
	typedef unsigned long long ull;
	typedef pair<int, int> pii;
	typedef long double ld;
}

namespace numbers_operation {
	template<class T>
	T floor_mod(T a, T b) {
		if (a >= 0 && b >= 0) return a % b;
		if (a <= 0 && b <= 0) return a % b;
		return abs(b) - (abs(a) % abs(b));
	}
}

using namespace numbers_operation;
using namespace typedefs;
using namespace random;

vector<vector<int>> g;
vector<vector<int>> plans;
vector<int> cost;
vector<int> tsize;

void dfs(int v, int _p) {
	tsize[v] = 1;
	for (int sub : g[v]) {
		if (sub == _p) continue;
		dfs(sub, v);
		tsize[v] += tsize[sub];
	}
}

struct Carry {
	ll mod = 0;
	unordered_map<int, ll> elems;
	ll get(int key) {
		return elems[key] + mod;
	}
	void add(int key, ll value) {
		elems[key] = value - mod;
	}
};

vector<ll> mem;

void dp(int v, int _p, Carry &base) {
	int _max = -1;
	for (int sub : g[v]) {
		if (sub == _p) continue;
		if (_max == -1 || tsize[sub] > tsize[_max])
			_max = sub;
	}
	if (_max != -1) {
		dp(_max, v, base);
	}
	vector<pair<Carry, int>> carries;
	for (int sub : g[v]) {
		if (sub == _p || sub == _max) continue;
		carries.emplace_back(Carry(), sub);
		dp(sub, v, carries.back().x);
	}
	ll all = 0;
	for (int sub : g[v]) {
		if (sub == _p) continue;
		all += mem[sub];
	}
	mem[v] = all;
	if (_max != -1) 
		base.mod += all - mem[_max];
	for (int plan : plans[v]) {
		if (base.elems.count(plan)) {
			mem[v] = max(mem[v], base.get(plan) + cost[plan]);
			base.elems.erase(plan);
		} else {
			base.add(plan, all);
		}
	}

	for (auto t : carries) {
		t.x.mod += all - mem[t.y];
		for (auto p : t.x.elems) {
			if (base.elems.count(p.x)) {
				mem[v] = max(mem[v], base.get(p.x) + t.x.get(p.x) - all + cost[p.x]);
				base.elems.erase(p.x);
			} else {
				base.add(p.x, t.x.get(p.x));
			}
		}
	}
}

signed main(signed argc, char *argv[]) {
	int n;
	scan n;
	mem.resize(n);
	tsize.resize(n);
	g.resize(n);
	plans.resize(n);
	f(i, n - 1) {
		int a, b;
		scan a, b;
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	int m;
	scan m;
	cost.resize(m);
	f(i, m) {
		int a, b, c;
		scan a, b, c;
		a--;b--;
		cost[i] = c;
		plans[a].pb(i);
		plans[b].pb(i);
	}

	dfs(0, -1);
	Carry base;
	dp(0, -1, base);
	print mem[0];
}

Compilation message

election_campaign.cpp: In function 'void fast_scan(int&)':
election_campaign.cpp:138:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(int &x) { scanf("%d", &x); }
                          ~~~~~^~~~~~~~~~
election_campaign.cpp: In function 'void fast_scan(long long int&)':
election_campaign.cpp:139:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(long long &x) { scanf("%lld", &x); }
                                ~~~~~^~~~~~~~~~~~
election_campaign.cpp: In function 'void fast_scan(long long unsigned int&)':
election_campaign.cpp:140:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(unsigned long long &x) { scanf("%llu", &x); }
                                         ~~~~~^~~~~~~~~~~~
election_campaign.cpp: In function 'void fast_scan(double&)':
election_campaign.cpp:141:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(double &x) { scanf("%lf", &x); }
                             ~~~~~^~~~~~~~~~~
election_campaign.cpp: In function 'void fast_scan(long double&)':
election_campaign.cpp:142:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(long double &x) { scanf("%Lf", &x); }
                                  ~~~~~^~~~~~~~~~~
election_campaign.cpp: In function 'void fast_scan(char&)':
election_campaign.cpp:144:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%c", &x);
  ~~~~~^~~~~~~~~~
election_campaign.cpp: In function 'void fast_scan(std::__cxx11::string&)':
election_campaign.cpp:150:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", string_in_buffer);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 91 ms 13816 KB Output is correct
6 Correct 57 ms 30828 KB Output is correct
7 Correct 89 ms 24796 KB Output is correct
8 Correct 88 ms 26232 KB Output is correct
9 Correct 107 ms 20088 KB Output is correct
10 Correct 100 ms 26332 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 154 ms 36344 KB Output is correct
5 Correct 183 ms 36344 KB Output is correct
6 Correct 131 ms 35960 KB Output is correct
7 Correct 123 ms 36344 KB Output is correct
8 Correct 162 ms 36376 KB Output is correct
9 Correct 174 ms 35864 KB Output is correct
10 Correct 199 ms 36392 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 154 ms 36344 KB Output is correct
5 Correct 183 ms 36344 KB Output is correct
6 Correct 131 ms 35960 KB Output is correct
7 Correct 123 ms 36344 KB Output is correct
8 Correct 162 ms 36376 KB Output is correct
9 Correct 174 ms 35864 KB Output is correct
10 Correct 199 ms 36392 KB Output is correct
11 Correct 18 ms 1920 KB Output is correct
12 Correct 171 ms 36396 KB Output is correct
13 Correct 137 ms 36284 KB Output is correct
14 Correct 136 ms 36004 KB Output is correct
15 Correct 141 ms 36468 KB Output is correct
16 Correct 144 ms 35964 KB Output is correct
17 Correct 137 ms 36488 KB Output is correct
18 Correct 125 ms 36344 KB Output is correct
19 Correct 129 ms 36088 KB Output is correct
20 Correct 131 ms 36348 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 480 ms 81824 KB Output is correct
2 Correct 151 ms 35960 KB Output is correct
3 Correct 274 ms 35804 KB Output is correct
4 Correct 319 ms 55544 KB Output is correct
5 Correct 238 ms 31376 KB Output is correct
6 Correct 364 ms 53972 KB Output is correct
7 Correct 265 ms 35580 KB Output is correct
8 Correct 298 ms 42120 KB Output is correct
9 Correct 134 ms 36088 KB Output is correct
10 Correct 216 ms 33692 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 91 ms 13816 KB Output is correct
6 Correct 57 ms 30828 KB Output is correct
7 Correct 89 ms 24796 KB Output is correct
8 Correct 88 ms 26232 KB Output is correct
9 Correct 107 ms 20088 KB Output is correct
10 Correct 100 ms 26332 KB Output is correct
11 Correct 5 ms 840 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 4 ms 640 KB Output is correct
14 Correct 4 ms 896 KB Output is correct
15 Correct 4 ms 896 KB Output is correct
16 Correct 6 ms 640 KB Output is correct
17 Correct 4 ms 896 KB Output is correct
18 Correct 2 ms 640 KB Output is correct
19 Correct 3 ms 768 KB Output is correct
20 Correct 3 ms 640 KB Output is correct

Subtask #6
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 91 ms 13816 KB Output is correct
6 Correct 57 ms 30828 KB Output is correct
7 Correct 89 ms 24796 KB Output is correct
8 Correct 88 ms 26232 KB Output is correct
9 Correct 107 ms 20088 KB Output is correct
10 Correct 100 ms 26332 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 154 ms 36344 KB Output is correct
15 Correct 183 ms 36344 KB Output is correct
16 Correct 131 ms 35960 KB Output is correct
17 Correct 123 ms 36344 KB Output is correct
18 Correct 162 ms 36376 KB Output is correct
19 Correct 174 ms 35864 KB Output is correct
20 Correct 199 ms 36392 KB Output is correct
21 Correct 18 ms 1920 KB Output is correct
22 Correct 171 ms 36396 KB Output is correct
23 Correct 137 ms 36284 KB Output is correct
24 Correct 136 ms 36004 KB Output is correct
25 Correct 141 ms 36468 KB Output is correct
26 Correct 144 ms 35964 KB Output is correct
27 Correct 137 ms 36488 KB Output is correct
28 Correct 125 ms 36344 KB Output is correct
29 Correct 129 ms 36088 KB Output is correct
30 Correct 131 ms 36348 KB Output is correct
31 Correct 480 ms 81824 KB Output is correct
32 Correct 151 ms 35960 KB Output is correct
33 Correct 274 ms 35804 KB Output is correct
34 Correct 319 ms 55544 KB Output is correct
35 Correct 238 ms 31376 KB Output is correct
36 Correct 364 ms 53972 KB Output is correct
37 Correct 265 ms 35580 KB Output is correct
38 Correct 298 ms 42120 KB Output is correct
39 Correct 134 ms 36088 KB Output is correct
40 Correct 216 ms 33692 KB Output is correct
41 Correct 5 ms 840 KB Output is correct
42 Correct 3 ms 640 KB Output is correct
43 Correct 4 ms 640 KB Output is correct
44 Correct 4 ms 896 KB Output is correct
45 Correct 4 ms 896 KB Output is correct
46 Correct 6 ms 640 KB Output is correct
47 Correct 4 ms 896 KB Output is correct
48 Correct 2 ms 640 KB Output is correct
49 Correct 3 ms 768 KB Output is correct
50 Correct 3 ms 640 KB Output is correct
51 Correct 264 ms 41576 KB Output is correct
52 Correct 133 ms 36372 KB Output is correct
53 Correct 215 ms 34180 KB Output is correct
54 Correct 202 ms 45432 KB Output is correct
55 Correct 342 ms 80008 KB Output is correct
56 Correct 141 ms 36308 KB Output is correct
57 Correct 167 ms 30028 KB Output is correct
58 Correct 281 ms 53112 KB Output is correct
59 Correct 248 ms 41464 KB Output is correct
60 Correct 145 ms 36344 KB Output is correct
61 Correct 243 ms 30328 KB Output is correct
62 Correct 260 ms 56788 KB Output is correct
63 Correct 344 ms 81220 KB Output is correct
64 Correct 143 ms 36472 KB Output is correct
65 Correct 198 ms 35324 KB Output is correct
66 Correct 202 ms 44280 KB Output is correct
67 Correct 450 ms 82216 KB Output is correct
68 Correct 129 ms 36368 KB Output is correct
69 Correct 232 ms 27296 KB Output is correct
70 Correct 303 ms 51184 KB Output is correct