oj.uz

Submission #324470

# Submission time Handle Problem Language Result Execution time Memory
324470 2020-11-15T06:21:34 Z vivaan_gupta Relay Marathon (NOI20_relaymarathon) C++14
17 / 100
 759 ms 4588 KB 
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double; 
using str = string; // yay python!

using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>; 
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>; 
using vpd = vector<pd>;

#define tcT template<class T
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 

// pairs
#define mp make_pair
#define f first
#define s second

// vectors
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

// loops
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

// helper funcs
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down

tcT> bool ckmin(T& a, const T& b) {
	return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
	return a < b ? a = b, 1 : 0; }

#define tcTU tcT, class U
tcTU> T fstTrue(T lo, T hi, U f) {
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true 
		T mid = lo+(hi-lo)/2;
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
	lo --; assert(lo <= hi); // assuming f is decreasing
	while (lo < hi) { // find first index such that f is true 
		T mid = lo+(hi-lo+1)/2;
		f(mid) ? lo = mid : hi = mid-1;
	} 
	return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
	sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
	auto it = t.find(u); assert(it != end(t));
	t.erase(u); } // element that doesn't exist from (multi)set

// INPUT
#define tcTUU tcT, class ...U
tcT> void re(complex<T>& c);
tcTU> void re(pair<T,U>& p);
tcT> void re(vector<T>& v);
tcT, size_t SZ> void re(AR<T,SZ>& a);

tcT> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); }

tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; }
tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
tcT> void re(vector<T>& x) { trav(a,x) re(a); }
tcT, size_t SZ> void re(AR<T,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
	#ifdef LOCAL
		return b ? "true" : "false"; 
	#else 
		return ts((int)b);
	#endif
}
tcT> str ts(complex<T> c) { 
	stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
	str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
	res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
tcTU> str ts(pair<T,U> p);
tcT> str ts(T v) { // containers with begin(), end()
	#ifdef LOCAL
		bool fst = 1; str res = "{";
		for (const auto& x: v) {
			if (!fst) res += ", ";
			fst = 0; res += ts(x);
		}
		res += "}"; return res;
	#else
		bool fst = 1; str res = "";
		for (const auto& x: v) {
			if (!fst) res += " ";
			fst = 0; res += ts(x);
		}
		return res;

	#endif
}
tcTU> str ts(pair<T,U> p) {
	#ifdef LOCAL
		return "("+ts(p.f)+", "+ts(p.s)+")"; 
	#else
		return ts(p.f)+" "+ts(p.s);
	#endif
}

// OUTPUT
tcT> void pr(T x) { cout << ts(x); }
tcTUU> void pr(const T& t, const U&... u) { 
	pr(t); pr(u...); }
void ps() { pr("\n"); } // print w/ spaces
tcTUU> void ps(const T& t, const U&... u) { 
	pr(t); if (sizeof...(u)) pr(" "); ps(u...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
tcTUU> void DBG(const T& t, const U&... u) {
	cerr << ts(t); if (sizeof...(u)) cerr << ", ";
	DBG(u...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
	#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
	#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
		 << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
	#define dbg(...) 0
	#define chk(...) 0
#endif

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str s = "") {
	unsyncIO();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
#define int ll
const int N = 505;
int adj[N][N];
int a[N];
void init(){
	FOR(i,1,N){
		FOR(j,1,N){
			adj[i][j]=INF;
		}
		adj[i][i]=0;
	}
}
signed main() {
	setIO();	
	int n,m,k;
	re(n,m,k);
	init();
	FOR(i,1,m+1){
		int u,v,w;
		re(u,v,w);
		adj[u][v]=w;
		adj[v][u]=w;
	}
	FOR(i,1,k+1) re(a[i]);
	FOR(k,1,n+1){
		FOR(i,1,n+1){
			FOR(j,1,n+1){
				if(adj[i][j] > adj[i][k]+adj[k][j]){
					adj[i][j] = adj[i][k] + adj[k][j];
				}
			}
		}
	}
	int ans = INF;
	FOR(i,1,k+1){
		priority_queue<pl,vector<pl>,greater<pl>> d;
		FOR(j,1,k+1){
			if(j != i)
				d.push(mp(adj[a[j]][a[i]],a[j]));
		}
		FOR(j,1,k+1){
			if(i == j) continue;
			FOR(u,1,k+1){
				if(u == i || u == j) continue;
				bool popped_u=false,popped_j=false;
				while(true){
					if(d.top().s == a[u]){
						d.pop();
						popped_u=true;
					}
					else if(d.top().s == a[j]){
						d.pop();
						popped_j=true;
					}
					else break;
				}
				if(!d.empty()){
					pl p = d.top();
					ans = min(ans,p.f + adj[a[j]][a[u]]);
				}
				if(popped_u){
					d.push({adj[a[i]][a[u]],a[u]});
				}
				if(popped_j){
					d.push({adj[a[i]][a[j]],a[j]});
				}
			}
		}
	}
	
	cout << ans << endl;

	// you should actually read the stuff at the bottom
}

/* stuff you should look for
	* read the probem 3 more times in case of WA :)
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/

Compilation message

RelayMarathon.cpp: In function 'void setIn(str)':
RelayMarathon.cpp:182:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  182 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
RelayMarathon.cpp: In function 'void setOut(str)':
RelayMarathon.cpp:183:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  183 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2432 KB Output is correct
2 Correct 2 ms 2284 KB Output is correct
3 Correct 2 ms 2284 KB Output is correct
4 Correct 2 ms 2284 KB Output is correct
5 Correct 2 ms 2364 KB Output is correct
6 Correct 3 ms 2284 KB Output is correct
7 Correct 2 ms 2284 KB Output is correct
8 Correct 2 ms 2284 KB Output is correct
9 Correct 2 ms 2284 KB Output is correct
10 Correct 2 ms 2284 KB Output is correct
11 Correct 3 ms 2304 KB Output is correct
12 Correct 2 ms 2432 KB Output is correct
13 Correct 3 ms 2284 KB Output is correct
14 Correct 2 ms 2284 KB Output is correct
15 Correct 3 ms 2284 KB Output is correct
16 Correct 2 ms 2284 KB Output is correct
17 Correct 3 ms 2412 KB Output is correct
18 Correct 2 ms 2284 KB Output is correct
19 Correct 4 ms 2284 KB Output is correct
20 Correct 2 ms 2284 KB Output is correct
21 Correct 2 ms 2284 KB Output is correct
22 Correct 2 ms 2284 KB Output is correct
23 Correct 3 ms 2284 KB Output is correct
24 Correct 2 ms 2284 KB Output is correct
25 Correct 2 ms 2284 KB Output is correct
26 Correct 2 ms 2284 KB Output is correct
27 Correct 2 ms 2284 KB Output is correct
28 Correct 4 ms 2284 KB Output is correct
29 Correct 3 ms 2284 KB Output is correct
30 Correct 2 ms 2284 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2432 KB Output is correct
2 Correct 2 ms 2284 KB Output is correct
3 Correct 2 ms 2284 KB Output is correct
4 Correct 2 ms 2284 KB Output is correct
5 Correct 2 ms 2364 KB Output is correct
6 Correct 3 ms 2284 KB Output is correct
7 Correct 2 ms 2284 KB Output is correct
8 Correct 2 ms 2284 KB Output is correct
9 Correct 2 ms 2284 KB Output is correct
10 Correct 2 ms 2284 KB Output is correct
11 Correct 3 ms 2304 KB Output is correct
12 Correct 2 ms 2432 KB Output is correct
13 Correct 3 ms 2284 KB Output is correct
14 Correct 2 ms 2284 KB Output is correct
15 Correct 3 ms 2284 KB Output is correct
16 Correct 2 ms 2284 KB Output is correct
17 Correct 3 ms 2412 KB Output is correct
18 Correct 2 ms 2284 KB Output is correct
19 Correct 4 ms 2284 KB Output is correct
20 Correct 2 ms 2284 KB Output is correct
21 Correct 2 ms 2284 KB Output is correct
22 Correct 2 ms 2284 KB Output is correct
23 Correct 3 ms 2284 KB Output is correct
24 Correct 2 ms 2284 KB Output is correct
25 Correct 2 ms 2284 KB Output is correct
26 Correct 2 ms 2284 KB Output is correct
27 Correct 2 ms 2284 KB Output is correct
28 Correct 4 ms 2284 KB Output is correct
29 Correct 3 ms 2284 KB Output is correct
30 Correct 2 ms 2284 KB Output is correct
31 Correct 128 ms 2284 KB Output is correct
32 Correct 132 ms 2284 KB Output is correct
33 Correct 146 ms 2412 KB Output is correct
34 Correct 137 ms 2284 KB Output is correct
35 Correct 126 ms 2520 KB Output is correct
36 Correct 344 ms 2412 KB Output is correct
37 Correct 759 ms 2540 KB Output is correct
38 Correct 175 ms 2284 KB Output is correct
39 Correct 196 ms 3436 KB Output is correct
40 Correct 280 ms 2540 KB Output is correct
41 Correct 147 ms 2408 KB Output is correct
42 Correct 421 ms 2668 KB Output is correct
43 Correct 266 ms 2540 KB Output is correct
44 Correct 177 ms 2284 KB Output is correct
45 Correct 145 ms 2412 KB Output is correct
46 Correct 478 ms 3564 KB Output is correct
47 Correct 281 ms 2796 KB Output is correct
48 Correct 211 ms 3180 KB Output is correct
49 Correct 318 ms 3308 KB Output is correct
50 Correct 154 ms 2284 KB Output is correct
51 Correct 299 ms 2412 KB Output is correct
52 Correct 189 ms 2464 KB Output is correct
53 Correct 176 ms 2924 KB Output is correct
54 Correct 190 ms 3436 KB Output is correct
55 Correct 135 ms 2284 KB Output is correct
56 Correct 126 ms 2284 KB Output is correct
57 Correct 138 ms 2412 KB Output is correct
58 Correct 220 ms 3820 KB Output is correct
59 Correct 148 ms 2412 KB Output is correct
60 Correct 310 ms 2468 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 4588 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2432 KB Output is correct
2 Correct 2 ms 2284 KB Output is correct
3 Correct 2 ms 2284 KB Output is correct
4 Correct 2 ms 2284 KB Output is correct
5 Correct 2 ms 2364 KB Output is correct
6 Correct 3 ms 2284 KB Output is correct
7 Correct 2 ms 2284 KB Output is correct
8 Correct 2 ms 2284 KB Output is correct
9 Correct 2 ms 2284 KB Output is correct
10 Correct 2 ms 2284 KB Output is correct
11 Correct 3 ms 2304 KB Output is correct
12 Correct 2 ms 2432 KB Output is correct
13 Correct 3 ms 2284 KB Output is correct
14 Correct 2 ms 2284 KB Output is correct
15 Correct 3 ms 2284 KB Output is correct
16 Correct 2 ms 2284 KB Output is correct
17 Correct 3 ms 2412 KB Output is correct
18 Correct 2 ms 2284 KB Output is correct
19 Correct 4 ms 2284 KB Output is correct
20 Correct 2 ms 2284 KB Output is correct
21 Correct 2 ms 2284 KB Output is correct
22 Correct 2 ms 2284 KB Output is correct
23 Correct 3 ms 2284 KB Output is correct
24 Correct 2 ms 2284 KB Output is correct
25 Correct 2 ms 2284 KB Output is correct
26 Correct 2 ms 2284 KB Output is correct
27 Correct 2 ms 2284 KB Output is correct
28 Correct 4 ms 2284 KB Output is correct
29 Correct 3 ms 2284 KB Output is correct
30 Correct 2 ms 2284 KB Output is correct
31 Correct 128 ms 2284 KB Output is correct
32 Correct 132 ms 2284 KB Output is correct
33 Correct 146 ms 2412 KB Output is correct
34 Correct 137 ms 2284 KB Output is correct
35 Correct 126 ms 2520 KB Output is correct
36 Correct 344 ms 2412 KB Output is correct
37 Correct 759 ms 2540 KB Output is correct
38 Correct 175 ms 2284 KB Output is correct
39 Correct 196 ms 3436 KB Output is correct
40 Correct 280 ms 2540 KB Output is correct
41 Correct 147 ms 2408 KB Output is correct
42 Correct 421 ms 2668 KB Output is correct
43 Correct 266 ms 2540 KB Output is correct
44 Correct 177 ms 2284 KB Output is correct
45 Correct 145 ms 2412 KB Output is correct
46 Correct 478 ms 3564 KB Output is correct
47 Correct 281 ms 2796 KB Output is correct
48 Correct 211 ms 3180 KB Output is correct
49 Correct 318 ms 3308 KB Output is correct
50 Correct 154 ms 2284 KB Output is correct
51 Correct 299 ms 2412 KB Output is correct
52 Correct 189 ms 2464 KB Output is correct
53 Correct 176 ms 2924 KB Output is correct
54 Correct 190 ms 3436 KB Output is correct
55 Correct 135 ms 2284 KB Output is correct
56 Correct 126 ms 2284 KB Output is correct
57 Correct 138 ms 2412 KB Output is correct
58 Correct 220 ms 3820 KB Output is correct
59 Correct 148 ms 2412 KB Output is correct
60 Correct 310 ms 2468 KB Output is correct
61 Runtime error 4 ms 4588 KB Execution killed with signal 11 (could be triggered by violating memory limits)
62 Halted 0 ms 0 KB -