oj.uz

답안 #396880

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
396880 2021-04-30T21:52:39 Z The_Blitz Jakarta Skyscrapers (APIO15_skyscraper) C++17
10 / 100
 2 ms 1016 KB 
// Restart
// += O(logn) ; + = O(n)
 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
 
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define fst first
#define snd second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define sz size()
#define FORN(i,j,n) for(int i=j; i<(int)n;i++) 
#define FOR(i,n) FORN(i,0,n)
#define FORIT(i,x) for( auto i = x.begin() ; i != x.end() ; i++ )
#define MOD 998244353LL
#define MOD1 1000000007LL
#define LIM 262150
#define ones(x) __builtin_popcount(x)
#define trace(x)    cerr << #x << ": " << x << endl;
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y,z) cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " << z << endl;
#define INF 1000000000
#define in(x)  cin>>x;
#define out(x) cout<<x;
#define MAXIMO 1LL<<60

#define loga2(x) __builtin_ctzll(x)
//SOLO PARA POTENCIAS DE 2
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll ;
typedef unsigned long long ull ;
typedef vector <int> vi;
typedef pair <int,int> ii;
typedef pair <int,ii> iii;
typedef vector <string> vs;
typedef vector <ii> vii;
typedef vector <iii> viii;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

int n,m;

int walks[30005];

vii G[30005];
int D[30005];

void Dijkstra(int start) {
    priority_queue<ii, vii, greater<ii> > pq;
 	D[start] = 0;

    pq.push({0, start});

    while(!pq.empty()) {
        int v = pq.top().snd; int d = pq.top().fst;

        pq.pop();
        //trace2(v,d);
        if(d <= D[v]){
	        for(auto uw : G[v]) {
	            int u = uw.fst;
	            int w = uw.snd;
	            if(D[u] > w + d) {
	            	D[u] = w + d;
	                pq.push({D[u], u});
	            }
	        }
	    }
    }
}


void go(){
	cin>>n>>m;

	int pos , jump;
	int t0, t1;

	cin>> t0 >> jump; walks[t0] = jump;//0
	cin>> t1 >> jump; //1

	for(int i=2; i<m; i++){
		cin>> pos >> jump;
		walks[pos] = jump;
	}

	FOR(i,n) D[i] = INF;

	int cont;

	FOR(i,n){
		int &j = walks[i];
		cont = 1;

		while(1) {
            int tower = i + cont * j;
            if( tower >= n )break;

            G[i].pb({tower, cont});
            if(walks[tower] == j)break;
            cont += 1;
        }

		cont = 1;
		while(1) {
            int tower = i - cont * j;
            if( tower < 0 )break;

            G[i].pb({tower, cont});
            if(walks[tower] == j)break;
            cont += 1;
        }


	}

	Dijkstra(t0);
    cout << (D[t1] == INF ? -1 : D[t1]) << "\n";


}


void timer(){
	clock_t begin = clock();
	go();
	clock_t end = clock();
	double time_spent = (double)(end - begin) / CLOCKS_PER_SEC;
	cout<<time_spent<<"\n";
}	

 
int main() {
  //fastio;
  go();
  //timer();
  return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 1016 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 2 ms 1008 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Incorrect 1 ms 972 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 2 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Incorrect 1 ms 972 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 1008 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1012 KB Output is correct
10 Incorrect 1 ms 972 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 976 KB Output is correct
10 Incorrect 1 ms 972 KB Output isn't correct
11 Halted 0 ms 0 KB -