oj.uz

Submission #60506

# Submission time Handle Problem Language Result Execution time Memory
60506 2018-07-24T09:27:15 Z istlemin Jakarta Skyscrapers (APIO15_skyscraper) C++14
10 / 100
 4 ms 624 KB 
#include<bits/stdc++.h>

using namespace std;

#define rep(i,a,b) for(int i = a; i<int(b);++i)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define trav(a,c) for(auto a: c)

typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;

int main(){
	cin.sync_with_stdio(false);
    ll n,m;
    cin>>n>>m;

    vi b(m);
    vi p(m);


    vector<set<ll> > doges(n);
    vector<vi> e;

    rep(i,0,m) {
		cin>>b[i]>>p[i];
        doges[b[i]].insert(i);
	}

    priority_queue<pair<ll,ll>,vector<pii>,greater<pii> > q; //(jumps,doge);
    q.emplace(0,0);

    vector<bool> seen(n);

    while(q.size()){
        ll pos,jumps;
        tie(jumps,pos) = q.top();
        q.pop();
        //cout<<pos<<" "<<jumps<<": "<<endl;

        if(pos<0||pos>=n) continue;
		if(seen[pos]) continue;
		seen[pos] = true;


        vector<bool> seenHere(n);

		trav(doge,doges[pos]){
			if(doge==1){
				cout<<jumps<<endl;
				return 0;
			}
			//rep(i,0,n)
			//	if((i-pos)%p[doge]==0&&!seen[i])
			//		q.emplace(jumps+abs(i-pos)/p[doge],i);
			ll pi = p[doge];
            rep(i,1,(n/pi+1)*2){
				//cout<<pos+pi*i<<endl;
				//if(seenHere[pos+pi*i]) break;
				//seenHere[pos+pi*i] = true;
				q.emplace(jumps+i,pos+pi*i);
				//if(seenHere[pos-pi*i]) break;
				//seenHere[pos-pi*i] = true;
				q.emplace(jumps+i,pos-pi*i);
            }
		}
        /*rep(i,0,n){
            if((b[i]-b[doge])%p[doge]==0&&!seen[i])
				q.emplace(jumps+abs(b[i]-b[doge])/p[doge],i);
        }*/
    }

    cout<<-1<<endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 568 KB Output is correct
2 Correct 3 ms 568 KB Output is correct
3 Correct 3 ms 568 KB Output is correct
4 Correct 3 ms 568 KB Output is correct
5 Correct 2 ms 568 KB Output is correct
6 Correct 3 ms 568 KB Output is correct
7 Correct 4 ms 568 KB Output is correct
8 Incorrect 2 ms 568 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 568 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 624 KB Output is correct
8 Incorrect 3 ms 624 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 624 KB Output is correct
2 Correct 2 ms 624 KB Output is correct
3 Correct 2 ms 624 KB Output is correct
4 Correct 2 ms 624 KB Output is correct
5 Correct 2 ms 624 KB Output is correct
6 Correct 3 ms 624 KB Output is correct
7 Correct 2 ms 624 KB Output is correct
8 Incorrect 4 ms 624 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 624 KB Output is correct
2 Correct 3 ms 624 KB Output is correct
3 Correct 3 ms 624 KB Output is correct
4 Correct 3 ms 624 KB Output is correct
5 Correct 3 ms 624 KB Output is correct
6 Correct 2 ms 624 KB Output is correct
7 Correct 4 ms 624 KB Output is correct
8 Incorrect 3 ms 624 KB Output isn't correct
9 Halted 0 ms 0 KB -