oj.uz

답안 #152551

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152551 2019-09-08T11:45:23 Z cheetose Toll (BOI17_toll) C++11
0 / 100
 143 ms 59112 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

typedef vector<Vi> matrix;
matrix A[50000][16];
int k,n,m,q;
matrix mul(const matrix &M1,const matrix &M2){
	matrix M(k,Vi(k,INF));
	fup(kk,0,k-1,1)
		fup(i,0,k-1,1)fup(j,0,k-1,1)
		M[i][j]=min(M[i][j],M1[i][kk]+M2[kk][j]);
	return M;
}
matrix g(int x,int y)
{
	matrix M=A[x][0];
	x++;
	int t=y-x;
	fdn(i,15,0,1)
	{
		if(t&(1<<i))
		{
			M=mul(M,A[x][i]);
			x+=(1<<i);
		}
	}
	return M;
}
int main() {
	scanf("%d%d%d%d",&k,&n,&m,&q);
	fup(i,0,n/k,1)A[i][0].resize(k,Vi(k,INF));
	fup(i,0,m-1,1)
	{
		int x,y,z;
		scanf("%d%d%d",&x,&y,&z);
		A[x/k][0][x%k][y%k]=min(z,A[x/k][0][x%k][y%k]);
	}
	fup(j,0,14,1)
	{
		fup(i,0,n/k,1)
		{
			if(i+(1<<j)+1>n/k)break;
			A[i][j+1]=mul(A[i][j],A[i+(1<<j)][j]);
		}
	}
	while(q--)
	{
		int a,b;
		scanf("%d%d",&a,&b);
		if(a/k==b/k)
		{
			puts("-1");
			continue;
		}
		matrix M=g(a/k,b/k);
		int ans=M[a%k][b%k];
		if(ans==INF)ans=-1;
		printf("%d\n",ans);
	}
}

Compilation message

toll.cpp: In function 'int main()':
toll.cpp:89:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d",&k,&n,&m,&q);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
toll.cpp:94:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&x,&y,&z);
   ~~~~~^~~~~~~~~~~~~~~~~~~
toll.cpp:108:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&a,&b);
   ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 58 ms 44792 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 143 ms 59112 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 44 ms 38392 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 44 ms 38392 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 58 ms 44792 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -