oj.uz

Submission #564667

# Submission time Handle Problem Language Result Execution time Memory
564667 2022-05-19T12:50:41 Z AbdullahMW Building Skyscrapers (CEOI19_skyscrapers) C++14
0 / 100
 3500 ms 16732 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;
unordered_map <ll, bool> occ;
void C(ll x, ll y)
{
    if (exist[{x, y}] && !vis[{x, y}])
    {
        vis[{x, y}] = true;
        c++;
        
        C(x + 1, y);
        C(x - 1, y);
        C(x, y + 1);
        C(x, y - 1);
        C(x + 1, y + 1);
        C(x + 1, y - 1);
        C(x - 1, y + 1);
        C(x - 1, y - 1);
        
    }
}

bool cyc = 0;
void dfs(ll px, ll py, ll x, ll y)
{
    if (exist[{x, y}]) 
    {
        vis[{x, y}] = true;
        
        if (!vis[{x + 1, y}])
        {
            dfs(x, y, x + 1, y);
        }
        else if (px != x + 1 && py != y)
        {
            cyc = true;
        }
        
        if (!vis[{x - 1, y}])
        {
            dfs(x, y, x - 1, y);
        }
        else if (px != x - 1 && py != y)
        {
            cyc = true;
        }
        
        if (!vis[{x, y + 1}])
        {
            dfs(x, y, x, y + 1);
        }
        else if (px != x && py != y + 1)
        {
            cyc = true;
        }
        
        if (!vis[{x, y - 1}])
        {
            dfs(x, y, x, y - 1);
        }
        else if (px != x && py != y - 1)
        {
            cyc = true;
        }
    }
    
}


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);
    for (ll i = 0; i < n; i++) 
    {
        cin >> a[i].f >> a[i].s;
        exist[a[i]] = true;
    }

    C(a[0].f, a[0].s);
    //cout << newl << c << newl << newl << newl;
    if (c != n) 
    {
        cout << "NO";
        return 0;
    }
    
    vector <ll> ans;
    for (ll i = 0; i < n; i++)
    {
        if (vis.size()) vis.clear();
        cyc = 0;
        dfs(a[i].f, a[i].s, a[i].f, a[i].s);
        
        if (cyc) occ[i] = true;
    }
    
    if (ans.size() > 1) 
    {
        cout << "NO";
        return 0;
    }
    
    cout << "YES" << newl;
    for (ll i = 0; i < n; i++)
    {
        if (!occ[i]) cout << i + 1 << newl;
    }
    
    for (ll i = 0; i < n; i++)
    {
        if (occ[i]) cout << i + 1 << newl;
    }
    
    //cout << 1;



    
    
    
}

Subtask #1
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 0 ms 212 KB ans=YES N=5
7 Correct 0 ms 212 KB ans=NO N=9
8 Correct 0 ms 212 KB ans=NO N=10
9 Incorrect 0 ms 212 KB Full cells must be connected
10 Halted 0 ms 0 KB -

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 0 ms 212 KB ans=YES N=5
7 Correct 0 ms 212 KB ans=NO N=9
8 Correct 0 ms 212 KB ans=NO N=10
9 Incorrect 0 ms 212 KB Full cells must be connected
10 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 0 ms 212 KB ans=YES N=5
7 Correct 0 ms 212 KB ans=NO N=9
8 Correct 0 ms 212 KB ans=NO N=10
9 Incorrect 0 ms 212 KB Full cells must be connected
10 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB ans=NO N=1934
2 Correct 2 ms 468 KB ans=NO N=1965
3 Incorrect 1874 ms 1008 KB Full cells must be connected
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 0 ms 212 KB ans=YES N=5
7 Correct 0 ms 212 KB ans=NO N=9
8 Correct 0 ms 212 KB ans=NO N=10
9 Incorrect 0 ms 212 KB Full cells must be connected
10 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 16484 KB ans=NO N=66151
2 Correct 51 ms 5320 KB ans=NO N=64333
3 Execution timed out 3574 ms 16732 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB ans=NO N=1934
2 Correct 2 ms 468 KB ans=NO N=1965
3 Incorrect 1874 ms 1008 KB Full cells must be connected
4 Halted 0 ms 0 KB -