oj.uz

Submission #299370

# Submission time Handle Problem Language Result Execution time Memory
299370 2020-09-14T19:49:22 Z AmineWeslati Toll (BOI17_toll) C++14
39 / 100
 3000 ms 7828 KB 
//Never stop trying
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
//#define int long long
typedef string str;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

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

const int MOD = 1e9 + 7; //998244353
const ll INF = 2e9;
const int MX = 5e4 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;

void IO() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}

inline int read(){
   int x=0; bool s=1; char c=getchar();
   while(c<'0'||c>'9'){ if(c=='-') s=0; c=getchar();}
   while(c>='0' && c<='9'){ x=(x<<3)+(x<<1)+c-'0'; c=getchar();}
   return s? x: -x;}


int K,N,M,Q;
vpi adj[MX];

int memo[MX];
int D;

int solve(int u){
	if(u==D) return 0;
	if(memo[u]!=-1) return memo[u];
	int ans=INF;
	for(auto v: adj[u]) ans=min(ans,solve(v.fi)+v.se);
	return memo[u]=ans;
}


int main() {
	boost; 

	//cin>>K>>N>>M>>Q;
	K=read(); N=read(); M=read(); Q=read();
	FOR(i,0,M){
		int u,v,w; 
		//cin>>u>>v>>w;
		u=read(); v=read(); w=read();
		adj[u].pb({v,w});
		assert(u/K+1==v/K);
	}

	while(Q--){
		int a,b; 
		//cin>>a>>b;
		a=read(); b=read();
		FOR(i,0,N) memo[i]=-1;
		D=b;
		int ans=solve(a);
		if(ans==INF) cout << -1 << endl;
		else cout << ans << endl;
	}




	return 0;
}

/* Careful!!!
	.Array bounds
	.Infinite loops
	.Uninitialized variables / empty containers
	.Order of input

   Some insights:
	.Binary search
	.Graph representation
	.Write brute force code
	.Change your approach
*/

Compilation message

toll.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("O3")
      | 
toll.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("unroll-loops")
      | 
toll.cpp: In function 'void IO()':
toll.cpp:49:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   49 |  freopen("input.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
toll.cpp:50:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |  freopen("output.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3080 ms 6668 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3054 ms 5608 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1536 KB Output is correct
2 Correct 2 ms 1568 KB Output is correct
3 Correct 2 ms 1536 KB Output is correct
4 Correct 2 ms 1536 KB Output is correct
5 Correct 1 ms 1536 KB Output is correct
6 Correct 2 ms 1536 KB Output is correct
7 Correct 3 ms 1536 KB Output is correct
8 Correct 4 ms 1664 KB Output is correct
9 Correct 4 ms 1664 KB Output is correct
10 Correct 21 ms 4224 KB Output is correct
11 Correct 117 ms 5884 KB Output is correct
12 Correct 141 ms 7164 KB Output is correct
13 Correct 168 ms 7672 KB Output is correct
14 Correct 139 ms 6404 KB Output is correct
15 Correct 90 ms 4352 KB Output is correct
16 Correct 87 ms 4352 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1536 KB Output is correct
2 Correct 2 ms 1568 KB Output is correct
3 Correct 2 ms 1536 KB Output is correct
4 Correct 2 ms 1536 KB Output is correct
5 Correct 1 ms 1536 KB Output is correct
6 Correct 2 ms 1536 KB Output is correct
7 Correct 3 ms 1536 KB Output is correct
8 Correct 4 ms 1664 KB Output is correct
9 Correct 4 ms 1664 KB Output is correct
10 Correct 21 ms 4224 KB Output is correct
11 Correct 117 ms 5884 KB Output is correct
12 Correct 141 ms 7164 KB Output is correct
13 Correct 168 ms 7672 KB Output is correct
14 Correct 139 ms 6404 KB Output is correct
15 Correct 90 ms 4352 KB Output is correct
16 Correct 87 ms 4352 KB Output is correct
17 Correct 2652 ms 6008 KB Output is correct
18 Correct 1 ms 1536 KB Output is correct
19 Correct 1 ms 1536 KB Output is correct
20 Correct 1 ms 1536 KB Output is correct
21 Correct 1 ms 1536 KB Output is correct
22 Correct 1 ms 1536 KB Output is correct
23 Correct 6 ms 1664 KB Output is correct
24 Correct 28 ms 1664 KB Output is correct
25 Correct 49 ms 1664 KB Output is correct
26 Correct 43 ms 1664 KB Output is correct
27 Correct 160 ms 4344 KB Output is correct
28 Correct 2892 ms 7160 KB Output is correct
29 Correct 2903 ms 7828 KB Output is correct
30 Correct 1453 ms 6136 KB Output is correct

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3080 ms 6668 KB Time limit exceeded
2 Halted 0 ms 0 KB -