Submission #159761

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
159761	2019-10-24T13:32:13 Z	Jatana	Travelling Merchant (APIO17_merchant)	C++17	100 / 100	390 ms	6208 KB

merchant

/*
                                                                                                     
                                             `-:://:::-                                             
                                           `//:-------:/:`                                          
                                          .+:--.......--:+`                                         
                                         `+:--..`````..--//`                                        
                                         .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(__int128 &x) {
	long long y;
	scanf("%lld", &y);
	x = y;
}
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); }
void fast_print(const __int128 &x) {
	long long y = x;
	fast_print(y);
}

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

#define int __int128
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 INF = 1e13;


int n, m, k;

vector<vector<pii>> cost;
vector<vector<int>> d;
vector<vector<int>> trade;

signed main(signed argc, char *argv[]) {
	scan n, m, k;
	cost.resize(n, vector<pii>(k));
	d.resize(n, vector<int>(n, INF));
	trade.resize(n, vector<int>(n));
	scan cost;
	f(i, m) {
		int a, b, w;
		scan a, b, w;
		a--;b--;
		d[a][b] = min(d[a][b], w);
	}
	f(k, n) {
		f(i, n) {
			f(j, n) {
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
			}
		}
	}
	f(i, n) {
		f(j, n) {
			f(t, k) {
				if (cost[i][t].x == -1 || cost[j][t].y == -1) continue;
				trade[i][j] = max(trade[i][j], -cost[i][t].x + cost[j][t].y);
			}
		}
	}
	int left = 0;
	int right = INF;
	while (right - left > 1) {
		int mid = (left + right) / 2;
		vector<vector<int>> A(n, vector<int>(n, -INF));
		f(i, n) {
			f(j, n) {
				A[i][j] = trade[i][j] - d[i][j] * mid;
			}
		}
		f(t, n) {
			f(i, n) {
				f(j, n) {
					A[i][j] = max(A[i][j], A[i][t] + A[t][j]);
				}
			}
		}
		bool found = false;
		f(i, n) {
			if (A[i][i] >= 0) {
				found = true;
			}	
		}
		if (found) {
			left = mid;
		} else {
			right = mid;
		}
	}
	print left;
}

Compilation message

merchant.cpp: In function 'void fast_scan(int&)':
merchant.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); }
                          ~~~~~^~~~~~~~~~
merchant.cpp: In function 'void fast_scan(long long int&)':
merchant.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); }
                                ~~~~~^~~~~~~~~~~~
merchant.cpp: In function 'void fast_scan(__int128&)':
merchant.cpp:137:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &y);
  ~~~~~^~~~~~~~~~~~
merchant.cpp: In function 'void fast_scan(long long unsigned int&)':
merchant.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); }
                                         ~~~~~^~~~~~~~~~~~
merchant.cpp: In function 'void fast_scan(double&)':
merchant.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); }
                             ~~~~~^~~~~~~~~~~
merchant.cpp: In function 'void fast_scan(long double&)':
merchant.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); }
                                  ~~~~~^~~~~~~~~~~
merchant.cpp: In function 'void fast_scan(char&)':
merchant.cpp:144:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%c", &x); 
  ~~~~~^~~~~~~~~~
merchant.cpp: In function 'void fast_scan(std::__cxx11::string&)':
merchant.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

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	233 ms	5240 KB	Output is correct
2	Correct	230 ms	1076 KB	Output is correct
3	Correct	202 ms	888 KB	Output is correct
4	Correct	25 ms	380 KB	Output is correct
5	Correct	25 ms	376 KB	Output is correct
6	Correct	33 ms	504 KB	Output is correct
7	Correct	32 ms	504 KB	Output is correct
8	Correct	2 ms	252 KB	Output is correct
9	Correct	29 ms	504 KB	Output is correct
10	Correct	26 ms	504 KB	Output is correct
11	Correct	26 ms	504 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	26 ms	632 KB	Output is correct

Subtask #2

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	27 ms	636 KB	Output is correct
2	Correct	35 ms	540 KB	Output is correct
3	Correct	33 ms	580 KB	Output is correct
4	Correct	31 ms	504 KB	Output is correct
5	Correct	33 ms	632 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	25 ms	504 KB	Output is correct
8	Correct	26 ms	504 KB	Output is correct
9	Correct	31 ms	556 KB	Output is correct
10	Correct	27 ms	504 KB	Output is correct
11	Correct	29 ms	604 KB	Output is correct
12	Correct	28 ms	504 KB	Output is correct
13	Correct	24 ms	504 KB	Output is correct
14	Correct	27 ms	476 KB	Output is correct
15	Correct	28 ms	632 KB	Output is correct
16	Correct	24 ms	504 KB	Output is correct
17	Correct	37 ms	632 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	36 ms	632 KB	Output is correct
20	Correct	31 ms	632 KB	Output is correct
21	Correct	30 ms	504 KB	Output is correct
22	Correct	24 ms	504 KB	Output is correct
23	Correct	26 ms	376 KB	Output is correct
24	Correct	33 ms	504 KB	Output is correct
25	Correct	32 ms	504 KB	Output is correct
26	Correct	2 ms	252 KB	Output is correct
27	Correct	29 ms	504 KB	Output is correct
28	Correct	26 ms	504 KB	Output is correct
29	Correct	26 ms	504 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	26 ms	632 KB	Output is correct

Subtask #3

33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	237 ms	1272 KB	Output is correct
2	Correct	390 ms	5436 KB	Output is correct
3	Correct	211 ms	1048 KB	Output is correct
4	Correct	249 ms	1384 KB	Output is correct
5	Correct	243 ms	1536 KB	Output is correct
6	Correct	186 ms	1080 KB	Output is correct
7	Correct	37 ms	632 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	36 ms	632 KB	Output is correct
10	Correct	31 ms	632 KB	Output is correct
11	Correct	30 ms	504 KB	Output is correct
12	Correct	24 ms	504 KB	Output is correct
13	Correct	26 ms	376 KB	Output is correct

Subtask #4

34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	27 ms	636 KB	Output is correct
2	Correct	35 ms	540 KB	Output is correct
3	Correct	33 ms	580 KB	Output is correct
4	Correct	31 ms	504 KB	Output is correct
5	Correct	33 ms	632 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	25 ms	504 KB	Output is correct
8	Correct	26 ms	504 KB	Output is correct
9	Correct	31 ms	556 KB	Output is correct
10	Correct	27 ms	504 KB	Output is correct
11	Correct	29 ms	604 KB	Output is correct
12	Correct	28 ms	504 KB	Output is correct
13	Correct	24 ms	504 KB	Output is correct
14	Correct	27 ms	476 KB	Output is correct
15	Correct	28 ms	632 KB	Output is correct
16	Correct	24 ms	504 KB	Output is correct
17	Correct	237 ms	1272 KB	Output is correct
18	Correct	390 ms	5436 KB	Output is correct
19	Correct	211 ms	1048 KB	Output is correct
20	Correct	249 ms	1384 KB	Output is correct
21	Correct	243 ms	1536 KB	Output is correct
22	Correct	186 ms	1080 KB	Output is correct
23	Correct	37 ms	632 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	36 ms	632 KB	Output is correct
26	Correct	31 ms	632 KB	Output is correct
27	Correct	30 ms	504 KB	Output is correct
28	Correct	24 ms	504 KB	Output is correct
29	Correct	26 ms	376 KB	Output is correct
30	Correct	197 ms	968 KB	Output is correct
31	Correct	185 ms	1440 KB	Output is correct
32	Correct	250 ms	3832 KB	Output is correct
33	Correct	239 ms	1240 KB	Output is correct
34	Correct	230 ms	1376 KB	Output is correct
35	Correct	196 ms	1336 KB	Output is correct
36	Correct	339 ms	5920 KB	Output is correct
37	Correct	2 ms	376 KB	Output is correct
38	Correct	2 ms	376 KB	Output is correct
39	Correct	162 ms	1032 KB	Output is correct
40	Correct	155 ms	1000 KB	Output is correct
41	Correct	166 ms	984 KB	Output is correct
42	Correct	171 ms	1048 KB	Output is correct
43	Correct	160 ms	1048 KB	Output is correct
44	Correct	2 ms	376 KB	Output is correct
45	Correct	31 ms	760 KB	Output is correct
46	Correct	30 ms	632 KB	Output is correct
47	Correct	30 ms	760 KB	Output is correct
48	Correct	277 ms	6072 KB	Output is correct
49	Correct	288 ms	6208 KB	Output is correct
50	Correct	2 ms	380 KB	Output is correct
51	Correct	233 ms	5240 KB	Output is correct
52	Correct	230 ms	1076 KB	Output is correct
53	Correct	202 ms	888 KB	Output is correct
54	Correct	25 ms	380 KB	Output is correct
55	Correct	25 ms	376 KB	Output is correct
56	Correct	33 ms	504 KB	Output is correct
57	Correct	32 ms	504 KB	Output is correct
58	Correct	2 ms	252 KB	Output is correct
59	Correct	29 ms	504 KB	Output is correct
60	Correct	26 ms	504 KB	Output is correct
61	Correct	26 ms	504 KB	Output is correct
62	Correct	2 ms	376 KB	Output is correct
63	Correct	26 ms	632 KB	Output is correct