oj.uz

Submission #93416

# Submission time Handle Problem Language Result Execution time Memory
93416 2019-01-08T10:49:34 Z Jatana Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 1396 ms 23420 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+/-.`                                           
                                               ``````                                               
*/

#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);}

#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());
};
#define int long long
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;

int n, m;
int S, T, U, V;
vector<vector<pii>> g;
vector<int> sdist;
vector<int> udist;
vector<int> vdist;
vector<int> tdist;

vector<int> dijkstra(int v) {
	vector<int> dist(n, 1e18);
	dist[v] = 0;
	auto cmp = [&dist](int a, int b) {
		return dist[a] > dist[b];
	};
	priority_queue<int, vector<int>, decltype(cmp)> deq(cmp);
	deq.push(v);
	while (!deq.empty()) {
		int v = deq.top();
		deq.pop();
		for (pii sub : g[v]) {
			if (dist[sub.x] > dist[v] + sub.y) {
				dist[sub.x] = dist[v] + sub.y;
				deq.push(sub.x);
			}
		}
	}
	return dist;
}

signed main(signed argc, char *argv[]) {
	scan n, m;	
	scan S, T, U, V;
	S--, T--, U--, V--;
	g.resize(n);
	f(i, m) {
		int a, b, w;
		scan a, b, w;
		a--;b--;
		g[a].emplace_back(b, w);
		g[b].emplace_back(a, w);
	}
	sdist = dijkstra(S);
	tdist = dijkstra(T);
	udist = dijkstra(U);
	vdist = dijkstra(V);
	vector<int> p(n);
	f(i, n) p[i] = i;
	sort(p.begin(), p.end(), [](int a, int b) {
		return tdist[a] < tdist[b];
	});
	vector<int> dp(n, 1e18);
	int rez = udist[V];
	for (int x : p) {
		if (tdist[x] + sdist[x] != sdist[T]) continue;
		dp[x] = udist[x];
		for (pii sub : g[x]) {
			dp[x] = min(dp[x], dp[sub.x]);
		}
		rez = min(rez, dp[x] + vdist[x]);
	}
	dp = vector<int>(n, 1e18);
	for (int x : p) {
		if (tdist[x] + sdist[x] != sdist[T]) continue;
		dp[x] = vdist[x];
		for (pii sub : g[x]) {
			dp[x] = min(dp[x], dp[sub.x]);
		}
		rez = min(rez, dp[x] + udist[x]);
	}
	print rez;
}

Compilation message

commuter_pass.cpp: In function 'void fast_scan(int&)':
commuter_pass.cpp:133: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); }
                          ~~~~~^~~~~~~~~~
commuter_pass.cpp: In function 'void fast_scan(long long int&)':
commuter_pass.cpp:134: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); }
                                ~~~~~^~~~~~~~~~~~
commuter_pass.cpp: In function 'void fast_scan(long long unsigned int&)':
commuter_pass.cpp:135: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); }
                                         ~~~~~^~~~~~~~~~~~
commuter_pass.cpp: In function 'void fast_scan(double&)':
commuter_pass.cpp:136: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); }
                             ~~~~~^~~~~~~~~~~
commuter_pass.cpp: In function 'void fast_scan(long double&)':
commuter_pass.cpp:137: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); }
                                  ~~~~~^~~~~~~~~~~
commuter_pass.cpp: In function 'void fast_scan(char&)':
commuter_pass.cpp:139:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%c", &x); 
  ~~~~~^~~~~~~~~~
commuter_pass.cpp: In function 'void fast_scan(std::__cxx11::string&)':
commuter_pass.cpp:145: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
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 398 ms 22476 KB Output is correct
2 Correct 497 ms 22044 KB Output is correct
3 Correct 922 ms 22436 KB Output is correct
4 Correct 432 ms 22388 KB Output is correct
5 Correct 428 ms 22124 KB Output is correct
6 Correct 408 ms 22300 KB Output is correct
7 Correct 624 ms 22032 KB Output is correct
8 Correct 462 ms 22096 KB Output is correct
9 Correct 388 ms 23096 KB Output is correct
10 Correct 318 ms 23312 KB Output is correct
11 Correct 165 ms 15352 KB Output is correct
12 Correct 412 ms 22904 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 961 ms 23164 KB Output is correct
2 Correct 993 ms 23276 KB Output is correct
3 Correct 931 ms 23212 KB Output is correct
4 Correct 989 ms 23248 KB Output is correct
5 Correct 971 ms 23080 KB Output is correct
6 Correct 567 ms 22236 KB Output is correct
7 Correct 1142 ms 23196 KB Output is correct
8 Correct 1117 ms 23420 KB Output is correct
9 Correct 1166 ms 23104 KB Output is correct
10 Correct 1396 ms 23412 KB Output is correct
11 Correct 235 ms 15480 KB Output is correct
12 Correct 598 ms 22388 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2040 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 19 ms 3752 KB Output is correct
5 Correct 10 ms 1912 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 4 ms 540 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 11 ms 2040 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 460 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 398 ms 22476 KB Output is correct
2 Correct 497 ms 22044 KB Output is correct
3 Correct 922 ms 22436 KB Output is correct
4 Correct 432 ms 22388 KB Output is correct
5 Correct 428 ms 22124 KB Output is correct
6 Correct 408 ms 22300 KB Output is correct
7 Correct 624 ms 22032 KB Output is correct
8 Correct 462 ms 22096 KB Output is correct
9 Correct 388 ms 23096 KB Output is correct
10 Correct 318 ms 23312 KB Output is correct
11 Correct 165 ms 15352 KB Output is correct
12 Correct 412 ms 22904 KB Output is correct
13 Correct 961 ms 23164 KB Output is correct
14 Correct 993 ms 23276 KB Output is correct
15 Correct 931 ms 23212 KB Output is correct
16 Correct 989 ms 23248 KB Output is correct
17 Correct 971 ms 23080 KB Output is correct
18 Correct 567 ms 22236 KB Output is correct
19 Correct 1142 ms 23196 KB Output is correct
20 Correct 1117 ms 23420 KB Output is correct
21 Correct 1166 ms 23104 KB Output is correct
22 Correct 1396 ms 23412 KB Output is correct
23 Correct 235 ms 15480 KB Output is correct
24 Correct 598 ms 22388 KB Output is correct
25 Correct 11 ms 2040 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 19 ms 3752 KB Output is correct
29 Correct 10 ms 1912 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 3 ms 504 KB Output is correct
32 Correct 4 ms 540 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 11 ms 2040 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 380 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 3 ms 460 KB Output is correct
40 Correct 331 ms 21896 KB Output is correct
41 Correct 364 ms 22912 KB Output is correct
42 Correct 338 ms 23092 KB Output is correct
43 Correct 173 ms 15480 KB Output is correct
44 Correct 120 ms 15484 KB Output is correct
45 Correct 373 ms 22140 KB Output is correct
46 Correct 320 ms 21840 KB Output is correct
47 Correct 400 ms 22356 KB Output is correct
48 Correct 133 ms 14892 KB Output is correct
49 Correct 296 ms 21432 KB Output is correct
50 Correct 336 ms 22132 KB Output is correct
51 Correct 293 ms 22100 KB Output is correct