oj.uz

Submission #263800

# Submission time Handle Problem Language Result Execution time Memory
263800 2020-08-14T02:13:16 Z kaage Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 972 ms 3452 KB 
#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define all(V) V.begin(),V.end()
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
	if (lhs < rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
	if (lhs > rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
inline lint gcd(lint a, lint b) {
	while (b) {
		lint c = a;
		a = b; b = c % b;
	}
	return a;
}
inline lint lcm(lint a, lint b) {
	return a / gcd(a, b) * b;
}
bool isprime(lint n) {
	if (n == 1)return false;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0)return false;
	}
	return true;
}
template<typename T>
T mypow(T a, lint b) {
	T res(1);
	while(b){
		if(b&1)res*=a;
		a*=a;
		b>>=1;
	}
	return res;
}
lint modpow(lint a, lint b, lint m) {
	lint res(1);
	while(b){
		if(b&1){
			res*=a;res%=m;
		}
		a*=a;a%=m;
		b>>=1;
	}
	return res;
}
template<typename T>
void printArray(std::vector<T>& vec) {
	rep(i, vec.size()){
		std::cout << vec[i];
		std::cout<<(i==(int)vec.size()-1?"\n":" ");
	}
}
template<typename T>
void printArray(T l, T r) {
	T rprev = std::prev(r);
	for (T i = l; i != rprev; i++) {
		std::cout << *i << " ";
	}
	std::cout << *rprev << std::endl;
}
LP extGcd(lint a,lint b) {
	if(b==0)return {1,0};
	LP s=extGcd(b,a%b);
	std::swap(s.first,s.second);
	s.second-=a/b*s.first;
	return s;
}
LP ChineseRem(const lint& b1,const lint& m1,const lint& b2,const lint& m2) {
	lint p=extGcd(m1,m2).first;
	lint tmp=(b2-b1)*p%m2;
	lint r=(b1+m1*tmp+m1*m2)%(m1*m2);
	return std::make_pair(r,m1*m2);
}
/*template<typename F>
inline constexpr decltype(auto) lambda_fix(F&& f){
	return [f=std::forward<F>(f)](auto&&... args){
		return f(f,std::forward<decltype(args)>(args)...);
	};
}*/
#line 2 "main.cpp"
int n,m,b[30010],p[30010];
int dist[30010];
std::vector<int> dvec[30010];
int main(){
	scanf("%d%d",&n,&m);
	rep(i,m){
		scanf("%d%d",b+i,p+i);
		dvec[b[i]].emplace_back(i);
	}
	std::fill(dist,dist+n,INF);
	prique<P> que;
	for(const int& i:dvec[b[0]])que.push({0,i});
	dist[b[0]]=0;
	while(!que.empty()){
		P s=que.top();
		que.pop();
		if(s.second==1){
			std::cout<<s.first<<std::endl;
			return 0;
		}
		if(dist[b[s.second]]<s.first)continue;
		int now=0;
		for(int i=b[s.second]-p[s.second];i>=0;i-=p[s.second]){
			now++;
			if(chmin(dist[i],dist[b[s.second]]+now)){
				for(const int& j:dvec[i]){
					que.push({dist[i],j});
				}
			}
		}
		now=0;
		for(int i=b[s.second]+p[s.second];i<n;i+=p[s.second]){
			now++;
			if(chmin(dist[i],dist[b[s.second]]+now)){
				for(const int& j:dvec[i]){
					que.push({dist[i],j});
				}
			}
		}
	}
	std::cout<<-1<<std::endl;
}

Compilation message

/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:3: warning: ignoring #pragma target  [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:4: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:5: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
main.cpp: In function 'int main()':
main.cpp:6:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
main.cpp:8:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1072 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 1 ms 1024 KB Output is correct
10 Correct 1 ms 1024 KB Output is correct
11 Correct 1 ms 1024 KB Output is correct
12 Correct 1 ms 1024 KB Output is correct
13 Correct 2 ms 1152 KB Output is correct
14 Correct 2 ms 1152 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 1 ms 1024 KB Output is correct
10 Correct 1 ms 1024 KB Output is correct
11 Correct 1 ms 1024 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 2 ms 1056 KB Output is correct
14 Correct 2 ms 1152 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct
16 Correct 1 ms 1024 KB Output is correct
17 Correct 2 ms 1152 KB Output is correct
18 Correct 1 ms 1024 KB Output is correct
19 Correct 1 ms 1024 KB Output is correct
20 Correct 6 ms 1152 KB Output is correct
21 Correct 1 ms 1024 KB Output is correct
22 Correct 1 ms 1024 KB Output is correct
23 Correct 1 ms 1024 KB Output is correct
24 Correct 2 ms 1152 KB Output is correct
25 Correct 2 ms 1152 KB Output is correct
26 Correct 1 ms 1024 KB Output is correct
27 Correct 2 ms 1152 KB Output is correct
28 Correct 2 ms 1152 KB Output is correct
29 Correct 1 ms 1024 KB Output is correct
30 Correct 1 ms 1024 KB Output is correct
31 Correct 1 ms 1024 KB Output is correct
32 Correct 1 ms 1024 KB Output is correct
33 Correct 2 ms 1152 KB Output is correct
34 Correct 2 ms 1152 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1024 KB Output is correct
11 Correct 1 ms 1024 KB Output is correct
12 Correct 1 ms 1024 KB Output is correct
13 Correct 2 ms 1152 KB Output is correct
14 Correct 2 ms 1152 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct
16 Correct 1 ms 1024 KB Output is correct
17 Correct 2 ms 1152 KB Output is correct
18 Correct 1 ms 1024 KB Output is correct
19 Correct 1 ms 1024 KB Output is correct
20 Correct 6 ms 1152 KB Output is correct
21 Correct 1 ms 1024 KB Output is correct
22 Correct 1 ms 1024 KB Output is correct
23 Correct 2 ms 1024 KB Output is correct
24 Correct 3 ms 1152 KB Output is correct
25 Correct 2 ms 1280 KB Output is correct
26 Correct 1 ms 1024 KB Output is correct
27 Correct 1 ms 1152 KB Output is correct
28 Correct 2 ms 1152 KB Output is correct
29 Correct 1 ms 1024 KB Output is correct
30 Correct 1 ms 1024 KB Output is correct
31 Correct 1 ms 1076 KB Output is correct
32 Correct 1 ms 1024 KB Output is correct
33 Correct 2 ms 1152 KB Output is correct
34 Correct 2 ms 1152 KB Output is correct
35 Correct 19 ms 2304 KB Output is correct
36 Correct 3 ms 1280 KB Output is correct
37 Correct 9 ms 2172 KB Output is correct
38 Correct 14 ms 2940 KB Output is correct
39 Correct 12 ms 1792 KB Output is correct
40 Correct 11 ms 2176 KB Output is correct
41 Correct 14 ms 3008 KB Output is correct
42 Correct 8 ms 1664 KB Output is correct
43 Correct 8 ms 2048 KB Output is correct
44 Correct 73 ms 2048 KB Output is correct
45 Correct 24 ms 2808 KB Output is correct
46 Correct 18 ms 2808 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 2 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 1 ms 1024 KB Output is correct
10 Correct 1 ms 1024 KB Output is correct
11 Correct 1 ms 1024 KB Output is correct
12 Correct 2 ms 1024 KB Output is correct
13 Correct 2 ms 1152 KB Output is correct
14 Correct 2 ms 1152 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct
16 Correct 1 ms 1024 KB Output is correct
17 Correct 2 ms 1152 KB Output is correct
18 Correct 1 ms 1024 KB Output is correct
19 Correct 1 ms 1024 KB Output is correct
20 Correct 6 ms 1152 KB Output is correct
21 Correct 1 ms 1024 KB Output is correct
22 Correct 1 ms 1024 KB Output is correct
23 Correct 1 ms 1024 KB Output is correct
24 Correct 2 ms 1152 KB Output is correct
25 Correct 2 ms 1152 KB Output is correct
26 Correct 2 ms 1024 KB Output is correct
27 Correct 2 ms 1152 KB Output is correct
28 Correct 2 ms 1152 KB Output is correct
29 Correct 1 ms 1024 KB Output is correct
30 Correct 1 ms 1024 KB Output is correct
31 Correct 1 ms 1024 KB Output is correct
32 Correct 1 ms 1024 KB Output is correct
33 Correct 3 ms 1152 KB Output is correct
34 Correct 3 ms 1244 KB Output is correct
35 Correct 13 ms 2304 KB Output is correct
36 Correct 3 ms 1280 KB Output is correct
37 Correct 9 ms 2172 KB Output is correct
38 Correct 15 ms 3068 KB Output is correct
39 Correct 10 ms 1792 KB Output is correct
40 Correct 13 ms 2176 KB Output is correct
41 Correct 14 ms 2940 KB Output is correct
42 Correct 8 ms 1792 KB Output is correct
43 Correct 9 ms 2048 KB Output is correct
44 Correct 77 ms 2072 KB Output is correct
45 Correct 23 ms 2784 KB Output is correct
46 Correct 18 ms 2808 KB Output is correct
47 Correct 15 ms 3068 KB Output is correct
48 Correct 10 ms 2048 KB Output is correct
49 Correct 9 ms 1920 KB Output is correct
50 Correct 7 ms 1792 KB Output is correct
51 Correct 21 ms 3452 KB Output is correct
52 Correct 21 ms 2944 KB Output is correct
53 Correct 13 ms 2560 KB Output is correct
54 Correct 1 ms 1152 KB Output is correct
55 Correct 1 ms 1152 KB Output is correct
56 Correct 968 ms 2944 KB Output is correct
57 Correct 3 ms 1408 KB Output is correct
58 Correct 972 ms 2048 KB Output is correct
59 Correct 9 ms 1792 KB Output is correct
60 Correct 7 ms 1792 KB Output is correct
61 Correct 10 ms 2176 KB Output is correct
62 Correct 17 ms 2688 KB Output is correct
63 Correct 23 ms 2432 KB Output is correct
64 Correct 19 ms 2432 KB Output is correct
65 Correct 26 ms 2432 KB Output is correct
66 Correct 34 ms 2936 KB Output is correct
67 Correct 34 ms 2936 KB Output is correct