oj.uz

Submission #260437

# Submission time Handle Problem Language Result Execution time Memory
260437 2020-08-10T09:08:42 Z stefantaga Building Skyscrapers (CEOI19_skyscrapers) C++14
8 / 100
 44 ms 888 KB 
#include <bits/stdc++.h>

using namespace std;
int dl[]={1,1,1,0,0,-1,-1,-1};
int dc[]={-1,0,1,-1,1,1,-1,0};
int dl2[]={1,0,0,-1};
int dc2[]={0,1,-1,0};
int n,t,i,sol[150005],nr,fr[150005],j,k;
pair <int,int> loc,b;
queue <int> q;
struct wow
{
    int x,y;
}v[150005];
int main()
{
    #ifdef HOME
    ifstream cin("date.in");
    ofstream cout("date.out");
    #endif // HOME
    cin>>n;
    cin>>t;
    for (i=1;i<=n;i++)
    {
        cin>>v[i].x>>v[i].y;
    }
    if (t==1)
    {
        q.push(1);
        sol[++nr]=1;
        fr[1]=1;
        while (!q.empty())
        {
            loc={v[q.front()].x,v[q.front()].y};
            q.pop();
            for (i=0;i<4;i++)
            {
                b.first=loc.first+dl2[i];
                b.second=loc.second+dc2[i];
                for (j=1;j<=n;j++)
                {
                    if (b.first==v[j].x&&b.second==v[j].y&&fr[j]==0)
                    {
                        sol[++nr]=j;
                        fr[j]=1;
                        q.push(j);
                    }
                }
            }
        }
        for (j=1;j<=n;j++)
        {
            if (fr[j]==1)
            {
                q.push(j);
            }
        }
        while (!q.empty())
        {
            loc={v[q.front()].x,v[q.front()].y};
            q.pop();
            for (i=0;i<8;i++)
            {
                b.first=loc.first+dl[i];
                b.second=loc.second+dc[i];
                for (j=1;j<=n;j++)
                {
                    if (b.first==v[j].x&&b.second==v[j].y&&fr[j]==0)
                    {
                        sol[++nr]=j;
                        fr[j]=1;
                        q.push(j);
                    }
                }
            }
        }
        for (i=1;i<=n;i++)
        {
            if (fr[i]==0)
            {
                cout<<"NO";
                return 0;
            }
        }
        cout<<"YES"<<'\n';
        for (i=1;i<=n;i++)
        {
            cout<<sol[i]<<'\n';
        }
    }
    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 44 ms 888 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -