oj.uz

Submission #564791

# Submission time Handle Problem Language Result Execution time Memory
564791 2022-05-19T16:15:01 Z AbdullahMW Building Skyscrapers (CEOI19_skyscrapers) C++14
8 / 100
 219 ms 18128 KB 
#include <bits/stdc++.h>
 
#define all(vec) vec.begin(), vec.end()
#define ll long long
#define db double
#define pb push_back
#define pf push_front
#define newl "\n"
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define f first
#define s second
#define MOD 1000000007
 
using namespace std;
 
#pragma GCC diagnostic ignored "-Wunused-result"
void setIO(string name = "") {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cout << fixed << setprecision(15);
    if (name.size()) {
        freopen((name+".in").c_str(), "r", stdin);
        freopen((name+".out").c_str(), "w", stdout);
    }
}
 
map <pair <ll, ll>, bool> vis, exist;
vector <pair <ll, ll>> ans;
priority_queue <pair <ll, ll>> pq;
void bfs(ll i, ll j)
{
    pq.push({i, j});
    vis[{i, j}] = true;
    ans.pb({i, j});
    while (pq.size())
    {
        ll x = pq.top().f, y = pq.top().s;
        pq.pop();
        
        if (exist[{x + 1, y}] && !vis[{x + 1, y}]) 
        {
            pq.push({x + 1, y});
            vis[{x + 1, y}] = true;
            ans.pb({x + 1, y});
        }
        if (exist[{x - 1, y}] && !vis[{x - 1, y}]) 
        {
            pq.push({x - 1, y});
            vis[{x - 1, y}] = true;
            ans.pb({x - 1, y});
        }
        if (exist[{x, y + 1}] && !vis[{x, y + 1}]) 
        {
            pq.push({x, y + 1});
            vis[{x, y + 1}] = true;
            ans.pb({x, y + 1});
        }
        if (exist[{x, y - 1}] && !vis[{x, y - 1}]) 
        {
            pq.push({x, y - 1});
            vis[{x, y - 1}] = true;
            ans.pb({x, y - 1});
        }
        if (exist[{x + 1, y + 1}] && !vis[{x + 1, y + 1}]) 
        {
            pq.push({x + 1, y + 1});
            vis[{x + 1, y + 1}] = true;
            ans.pb({x + 1, y + 1});
        }
        if (exist[{x + 1, y - 1}] && !vis[{x + 1, y - 1}]) 
        {
            pq.push({x + 1, y - 1});
            vis[{x + 1, y - 1}] = true;
            ans.pb({x + 1, y - 1});
        }
        if (exist[{x - 1, y + 1}] && !vis[{x - 1, y + 1}]) 
        {
            pq.push({x - 1, y + 1});
            vis[{x - 1, y + 1}] = true;
            ans.pb({x - 1, y + 1});
        }
        if (exist[{x - 1, y - 1}] && !vis[{x - 1, y - 1}]) 
        {
            pq.push({x - 1, y - 1});
            vis[{x - 1, y - 1}] = true;
            ans.pb({x - 1, y - 1});
        }
        
    }
}
 
int main()
{
    //fast
    //setIO("");
    
    //freopen("filename.in", "r", stdin);
    //freopen("filename.out", "w", stdout);
    
    ll n, t; cin >> n >> t;
    vector <pair <ll, ll>> a(n);
    map <pair <ll, ll>, ll> mp;
    for (ll i = 0; i < n; i++) 
    {
        cin >> a[i].f >> a[i].s;
        mp[a[i]] = i + 1;
        exist[a[i]] = true;
    }
    
    sort(a.rbegin(), a.rend());
    bfs(a[0].f, a[0].s);

    if (ans.size() < n) 
    {
        cout << "NO" << newl;
        return 0;
    }
    
    cout << "YES" << newl;
    for (auto v : ans) cout << mp[v] << newl;
    
    //cout << 1;
 
 
 
    
    
    
}

Compilation message

skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:112:20: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  112 |     if (ans.size() < n)
      |         ~~~~~~~~~~~^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Correct 0 ms 212 KB ans=NO N=4
4 Correct 0 ms 212 KB ans=YES N=5
5 Correct 1 ms 212 KB ans=YES N=9
6 Correct 1 ms 212 KB ans=YES N=5
7 Correct 1 ms 212 KB ans=NO N=9
8 Correct 1 ms 212 KB ans=NO N=10
9 Correct 1 ms 212 KB ans=YES N=10
10 Correct 1 ms 212 KB ans=YES N=10
11 Correct 1 ms 304 KB ans=YES N=10
12 Correct 1 ms 212 KB ans=YES N=9
13 Correct 1 ms 212 KB ans=YES N=9
14 Correct 1 ms 212 KB ans=YES N=8
15 Correct 1 ms 300 KB ans=YES N=8
16 Correct 1 ms 212 KB ans=NO N=2

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Correct 0 ms 212 KB ans=NO N=4
4 Correct 0 ms 212 KB ans=YES N=5
5 Correct 1 ms 212 KB ans=YES N=9
6 Correct 1 ms 212 KB ans=YES N=5
7 Correct 1 ms 212 KB ans=NO N=9
8 Correct 1 ms 212 KB ans=NO N=10
9 Correct 1 ms 212 KB ans=YES N=10
10 Correct 1 ms 212 KB ans=YES N=10
11 Correct 1 ms 304 KB ans=YES N=10
12 Correct 1 ms 212 KB ans=YES N=9
13 Correct 1 ms 212 KB ans=YES N=9
14 Correct 1 ms 212 KB ans=YES N=8
15 Correct 1 ms 300 KB ans=YES N=8
16 Correct 1 ms 212 KB ans=NO N=2
17 Incorrect 1 ms 212 KB Added cell 17 (1,2) not reachable from infinity
18 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Correct 0 ms 212 KB ans=NO N=4
4 Correct 0 ms 212 KB ans=YES N=5
5 Correct 1 ms 212 KB ans=YES N=9
6 Correct 1 ms 212 KB ans=YES N=5
7 Correct 1 ms 212 KB ans=NO N=9
8 Correct 1 ms 212 KB ans=NO N=10
9 Correct 1 ms 212 KB ans=YES N=10
10 Correct 1 ms 212 KB ans=YES N=10
11 Correct 1 ms 304 KB ans=YES N=10
12 Correct 1 ms 212 KB ans=YES N=9
13 Correct 1 ms 212 KB ans=YES N=9
14 Correct 1 ms 212 KB ans=YES N=8
15 Correct 1 ms 300 KB ans=YES N=8
16 Correct 1 ms 212 KB ans=NO N=2
17 Incorrect 1 ms 212 KB Added cell 17 (1,2) not reachable from infinity
18 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB ans=NO N=1934
2 Correct 2 ms 468 KB ans=NO N=1965
3 Incorrect 6 ms 724 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 974)
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Correct 0 ms 212 KB ans=NO N=4
4 Correct 0 ms 212 KB ans=YES N=5
5 Correct 1 ms 212 KB ans=YES N=9
6 Correct 1 ms 212 KB ans=YES N=5
7 Correct 1 ms 212 KB ans=NO N=9
8 Correct 1 ms 212 KB ans=NO N=10
9 Correct 1 ms 212 KB ans=YES N=10
10 Correct 1 ms 212 KB ans=YES N=10
11 Correct 1 ms 304 KB ans=YES N=10
12 Correct 1 ms 212 KB ans=YES N=9
13 Correct 1 ms 212 KB ans=YES N=9
14 Correct 1 ms 212 KB ans=YES N=8
15 Correct 1 ms 300 KB ans=YES N=8
16 Correct 1 ms 212 KB ans=NO N=2
17 Incorrect 1 ms 212 KB Added cell 17 (1,2) not reachable from infinity
18 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 18128 KB ans=NO N=66151
2 Correct 82 ms 9292 KB ans=NO N=64333
3 Incorrect 219 ms 16276 KB Contestant's solution is not lexicographically largest at index 69316 (69235 vs 51180)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB ans=NO N=1934
2 Correct 2 ms 468 KB ans=NO N=1965
3 Incorrect 6 ms 724 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 974)
4 Halted 0 ms 0 KB -