oj.uz

Submission #769683

# Submission time Handle Problem Language Result Execution time Memory
769683 2023-06-30T02:51:06 Z Charizard2021 Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 312 ms 262144 KB 
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);; cin.tie(NULL)
void selfMax(long long& a, long long b){
    a = max(a, b);
}
void selfMin(long long& a, long long b){
    a = min(a, b);
}
template<typename T> istream& operator>>(istream& in, vector<T>& a) {for(auto &x : a) in >> x; return in;};
template<typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& x) {return in >> x.first >> x.second;}

template<typename T1, typename T2> ostream& operator<<(ostream& out, const pair<T1, T2>& x) {return out << x.first << ' ' << x.second;}
template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {for(auto &x : a) out << x << ' '; return out;};
template<typename T> ostream& operator<<(ostream& out, vector<vector<T> >& a) {for(auto &x : a) out << x << '\n'; return out;};
template<typename T1, typename T2> ostream& operator<<(ostream& out, vector<pair<T1, T2> >& a) {for(auto &x : a) out << x << '\n'; return out;};

/*

Use DSU dsu(N);

*/
struct DSU {
	vector<long long> e;
	DSU(long long N) { e = vector<long long>(N, -1); }

	// get representive component (uses path compression)
	long long get(long long x) { return e[x] < 0 ? x : e[x] = get(e[x]); }

	bool same_set(long long a, long long b) { return get(a) == get(b); }

	long long size(long long x) { return -e[get(x)]; }

	bool unite(long long x, long long y) {  // union by size
		x = get(x), y = get(y);
		if (x == y) return false;
		if (e[x] > e[y]) swap(x, y);
		e[x] += e[y]; e[y] = x;
		return true;
	}
};
/*

Run with Bit<long long> BIT

*/
template <class T> class BIT {
    private:
        long long size;
        vector<T> bit;
        vector<T> arr;
    public:
        BIT(long long size) : size(size), bit(size + 1), arr(size) {}
        void set(long long ind, long long val) { add(ind, val - arr[ind]); }
        void add(long long ind, long long val) {
            arr[ind] += val;
            ind++;
            for (; ind <= size; ind += ind & -ind) { bit[ind] += val; }
        }
        T pref_sum(long long ind) {
            ind++;
            T total = 0;
            for (; ind > 0; ind -= ind & -ind) { total += bit[ind]; }
            return total;
        }
};
/*

Change Comb for specific Seg tree probs, but run with Seg<long long> Seg;

*/
template<class T> struct Seg {
	const T ID = 1e18; T comb(T a, T b) { return min(a,b); }
	long long n; vector<T> seg;
	void init(long long _n) { n = _n; seg.assign(2*n,ID); }
	void pull(long long p) { seg[p] = comb(seg[2*p],seg[2*p+1]); }
	void upd(long long p, T val) {
		seg[p += n] = val; for (p /= 2; p; p /= 2) pull(p); }
	T query(long long l, long long r) {
		T ra = ID, rb = ID;
		for (l += n, r += n+1; l < r; l /= 2, r /= 2) {
			if (l&1) ra = comb(ra,seg[l++]);
			if (r&1) rb = comb(seg[--r],rb);
		}
		return comb(ra,rb);
	}
};
int main(){
    long long n, m;
    cin >> n >> m;
    vector<pair<long long, long long> > dogs(m);
    for(long long i = 0; i < m; i++){
        cin >> dogs[i];
    }
    map<pair<long long, long long>, long long> mp;
    for(long long i = 0; i < m; i++){
        mp[dogs[i]]++;
    }
    vector<pair<long long,long long> > adj[n];
    for(long long i = 0; i < m; i++){
        if(0 <= dogs[i].first + dogs[i].second && dogs[i].first + dogs[i].second < n){
            adj[dogs[i].first].push_back(make_pair(dogs[i].second + dogs[i].first, 1));
            long long k = 2;
            while(0 <= dogs[i].first + dogs[i].second * k && dogs[i].first + dogs[i].second * k < n && mp.count(make_pair(dogs[i].first + dogs[i].second * k, dogs[i].second)) == 0){
                adj[dogs[i].first].push_back(make_pair(dogs[i].first + dogs[i].second * k, k));
                k++;
            }
            if(0 <= dogs[i].first + dogs[i].second * k && dogs[i].first + dogs[i].second * k < n){
                adj[dogs[i].first].push_back(make_pair(dogs[i].first + dogs[i].second * k, k));
            }
        }
        if(0 <= dogs[i].first - dogs[i].second && dogs[i].first - dogs[i].second < n){
            adj[dogs[i].first].push_back(make_pair(dogs[i].first - dogs[i].second, 1));
            long long k = 2;
            while(0 <= dogs[i].first - dogs[i].second * k && dogs[i].first - dogs[i].second * k < n && mp.count(make_pair(dogs[i].first - dogs[i].second * k, dogs[i].second)) == 0){
                adj[dogs[i].first].push_back(make_pair(dogs[i].first - dogs[i].second * k, k));
                k++;
            }
            if(0 <= dogs[i].first - dogs[i].second * k && dogs[i].first - dogs[i].second * k < n){
                adj[dogs[i].first].push_back(make_pair(dogs[i].first - dogs[i].second * k, k));
            }
        }
    }
    priority_queue<pair<long long, long long> > pq;
    vector<long long> distances(n, 1e18);
    distances[dogs[0].first] = 0;
    pq.push(make_pair(0, dogs[0].first));
    while(!pq.empty()){
        pair<long long, long long> x2 = pq.top();
        pq.pop();
        if(distances[x2.second] != x2.first){
            continue;
        }
        long long u = x2.second;
        for(pair<long long, long long> x : adj[u]){
            long long v = x.first;
            if(distances[v] > distances[u] + x.second){
                distances[v] = distances[u] + x.second;
                pq.push(make_pair(distances[v], v));
            }
        }
    }
    if(distances[dogs[1].first] == (long long)1e18){
        cout << -1 << "\n";
    }
    else{
        cout << distances[dogs[1].first] << "\n";
    }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 564 KB Output is correct
12 Correct 6 ms 4548 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 472 KB Output is correct
15 Correct 2 ms 468 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 6 ms 4576 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 15 ms 724 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 432 KB Output is correct
20 Correct 2 ms 692 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 432 KB Output is correct
23 Correct 5 ms 468 KB Output is correct
24 Correct 25 ms 724 KB Output is correct
25 Correct 5 ms 724 KB Output is correct
26 Correct 91 ms 66288 KB Output is correct
27 Correct 100 ms 66272 KB Output is correct
28 Correct 3 ms 980 KB Output is correct
29 Correct 3 ms 1820 KB Output is correct
30 Correct 2 ms 808 KB Output is correct
31 Correct 3 ms 1196 KB Output is correct
32 Correct 2 ms 940 KB Output is correct
33 Correct 5 ms 3156 KB Output is correct
34 Correct 5 ms 3124 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 260 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 5 ms 4548 KB Output is correct
13 Correct 2 ms 564 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 560 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 15 ms 828 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 2 ms 692 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 428 KB Output is correct
23 Correct 5 ms 468 KB Output is correct
24 Correct 26 ms 724 KB Output is correct
25 Correct 5 ms 724 KB Output is correct
26 Correct 92 ms 66256 KB Output is correct
27 Correct 99 ms 66256 KB Output is correct
28 Correct 4 ms 1004 KB Output is correct
29 Correct 3 ms 1876 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 3 ms 1108 KB Output is correct
32 Correct 2 ms 852 KB Output is correct
33 Correct 5 ms 3124 KB Output is correct
34 Correct 5 ms 3024 KB Output is correct
35 Correct 132 ms 4724 KB Output is correct
36 Correct 23 ms 980 KB Output is correct
37 Correct 217 ms 6356 KB Output is correct
38 Correct 291 ms 6532 KB Output is correct
39 Correct 246 ms 6592 KB Output is correct
40 Correct 312 ms 6500 KB Output is correct
41 Correct 279 ms 6600 KB Output is correct
42 Runtime error 256 ms 262144 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 5 ms 4548 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 15 ms 724 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 5 ms 588 KB Output is correct
24 Correct 26 ms 820 KB Output is correct
25 Correct 5 ms 724 KB Output is correct
26 Correct 95 ms 66420 KB Output is correct
27 Correct 101 ms 66320 KB Output is correct
28 Correct 3 ms 980 KB Output is correct
29 Correct 3 ms 1748 KB Output is correct
30 Correct 2 ms 724 KB Output is correct
31 Correct 3 ms 1108 KB Output is correct
32 Correct 2 ms 940 KB Output is correct
33 Correct 5 ms 3156 KB Output is correct
34 Correct 5 ms 3024 KB Output is correct
35 Correct 127 ms 4728 KB Output is correct
36 Correct 25 ms 1080 KB Output is correct
37 Correct 224 ms 6368 KB Output is correct
38 Correct 239 ms 6600 KB Output is correct
39 Correct 249 ms 6604 KB Output is correct
40 Correct 303 ms 6540 KB Output is correct
41 Correct 273 ms 6596 KB Output is correct
42 Runtime error 248 ms 262144 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -