oj.uz

Submission #564769

# Submission time Handle Problem Language Result Execution time Memory
564769 2022-05-19T15:44:52 Z AbdullahMW Building Skyscrapers (CEOI19_skyscrapers) C++14
0 / 100
 112 ms 10312 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);
    }
}
 
ll c = 0;
map <pair <ll, ll>, bool> vis, exist;
priority_queue <pair <ll, ll>, vector <pair <ll, ll>>, greater <pair <ll, ll>>> pq;
void bfs(ll x, ll y)
{
    pq.push({x, y});
    while (pq.size())
    {
        c++;
        x = pq.top().f, y = pq.top().s;
        vis[{x, y}] = true;
        pq.pop();
        
        if (exist[{x + 1, y}] && !vis[{x + 1, y}]) pq.push({x + 1, y});
        if (exist[{x - 1, y}] && !vis[{x - 1, y}]) pq.push({x - 1, y});
        if (exist[{x, y + 1}] && !vis[{x, y + 1}]) pq.push({x, y + 1});
        if (exist[{x, y - 1}] && !vis[{x, y - 1}]) pq.push({x, y - 1});
        
        //if (exist[{x + 1, y + 1}] && !vis[{x + 1, y + 1}]) pq.push({x + 1, y + 1});
        //if (exist[{x + 1, y - 1}] && !vis[{x + 1, y - 1}]) pq.push({x + 1, y - 1});
        //if (exist[{x - 1, y + 1}] && !vis[{x - 1, y + 1}]) pq.push({x - 1, y + 1});
        //if (exist[{x - 1, y - 1}] && !vis[{x - 1, y - 1}]) pq.push({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(all(a));
    bfs(a[0].f, a[0].s);

    if (c != n) 
    {
        cout << "NO";
        return 0;
    }
    
    cout << "YES" << newl;
    for (auto v : a) cout << mp[v] << newl;
    
    //cout << 1;
 
 
 
    
    
    
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Incorrect 1 ms 212 KB Contestant did not find solution
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Incorrect 1 ms 212 KB Contestant did not find solution
3 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Incorrect 1 ms 212 KB Contestant did not find solution
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 572 KB ans=NO N=1934
2 Correct 3 ms 596 KB ans=NO N=1965
3 Incorrect 3 ms 468 KB Contestant did not find solution
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Incorrect 1 ms 212 KB Contestant did not find solution
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 9580 KB ans=NO N=66151
2 Correct 102 ms 9612 KB ans=NO N=64333
3 Incorrect 112 ms 10312 KB Contestant did not find solution
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 572 KB ans=NO N=1934
2 Correct 3 ms 596 KB ans=NO N=1965
3 Incorrect 3 ms 468 KB Contestant did not find solution
4 Halted 0 ms 0 KB -