oj.uz

답안 #564463

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
564463 2022-05-19T09:21:16 Z Dodo Building Skyscrapers (CEOI19_skyscrapers) C++14
0 / 100
 314 ms 33808 KB 
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define pb push_back
using namespace std;
const ll mx=150005;
vector<ll>v[mx];
bool m=false;
ll cnt=0;
bool visited[mx];

void dfs (ll x)
{
  cnt++;
  if(m)cout<<x<<endl;
  visited[x]=1;

  for(auto u:v[x])
    if(visited[u]==0)
     dfs(u);
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    ll n,t;
    cin>>n>>t;
    vector<pair<ll,ll>>b(n);
    map<pair<ll,ll>,ll>mp;

    for(int i=0;i<n;i++)
    {
      ll x,y;
      cin>>x>>y;
      b[i]={x,y};
      mp[{x,y}]=i+1;
    }

    ll x[8]={1,1,1,-1,-1,-1,0,0},y[8]={1,-1,0,1,-1,0,1,-1};
    ll lmt=1e9;

    for(int i=0;i<n;i++)
    {
      ll f=b[i].first,s=b[i].second;
      for(int j=0;j<8;j++)
      {
        if(f+y[j]>lmt||s+x[j]>lmt)continue;
        if(mp[{f+y[j],s+x[j]}]>0)
        {
          v[mp[{f,s}]].push_back(mp[{f+y[j],s+x[j]}]);
        }
      }
    }

    dfs(1);
    if(cnt!=n)
    {
      cout<<"NO"<<endl;
    }
    else
    {
      for(int i=1;i<=n;i++)visited[i]=0;
      m=true;
      cout<<"YES"<<endl;
      dfs(1);
    }
    return 0;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3796 KB ans=YES N=1
2 Correct 2 ms 3796 KB ans=YES N=4
3 Correct 2 ms 3856 KB ans=NO N=4
4 Correct 2 ms 3852 KB ans=YES N=5
5 Correct 2 ms 3796 KB ans=YES N=9
6 Correct 2 ms 3796 KB ans=YES N=5
7 Correct 2 ms 3796 KB ans=NO N=9
8 Correct 2 ms 3852 KB ans=NO N=10
9 Correct 3 ms 3796 KB ans=YES N=10
10 Incorrect 2 ms 3796 KB Added cell 10 (2,0) not reachable from infinity
11 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3796 KB ans=YES N=1
2 Correct 2 ms 3796 KB ans=YES N=4
3 Correct 2 ms 3856 KB ans=NO N=4
4 Correct 2 ms 3852 KB ans=YES N=5
5 Correct 2 ms 3796 KB ans=YES N=9
6 Correct 2 ms 3796 KB ans=YES N=5
7 Correct 2 ms 3796 KB ans=NO N=9
8 Correct 2 ms 3852 KB ans=NO N=10
9 Correct 3 ms 3796 KB ans=YES N=10
10 Incorrect 2 ms 3796 KB Added cell 10 (2,0) not reachable from infinity
11 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3796 KB ans=YES N=1
2 Correct 2 ms 3796 KB ans=YES N=4
3 Correct 2 ms 3856 KB ans=NO N=4
4 Correct 2 ms 3852 KB ans=YES N=5
5 Correct 2 ms 3796 KB ans=YES N=9
6 Correct 2 ms 3796 KB ans=YES N=5
7 Correct 2 ms 3796 KB ans=NO N=9
8 Correct 2 ms 3852 KB ans=NO N=10
9 Correct 3 ms 3796 KB ans=YES N=10
10 Incorrect 2 ms 3796 KB Added cell 10 (2,0) not reachable from infinity
11 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4948 KB ans=NO N=1934
2 Correct 7 ms 4308 KB ans=NO N=1965
3 Incorrect 8 ms 4180 KB Added cell 1819 (352,202) not reachable from infinity
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3796 KB ans=YES N=1
2 Correct 2 ms 3796 KB ans=YES N=4
3 Correct 2 ms 3856 KB ans=NO N=4
4 Correct 2 ms 3852 KB ans=YES N=5
5 Correct 2 ms 3796 KB ans=YES N=9
6 Correct 2 ms 3796 KB ans=YES N=5
7 Correct 2 ms 3796 KB ans=NO N=9
8 Correct 2 ms 3852 KB ans=NO N=10
9 Correct 3 ms 3796 KB ans=YES N=10
10 Incorrect 2 ms 3796 KB Added cell 10 (2,0) not reachable from infinity
11 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 18316 KB ans=NO N=66151
2 Correct 299 ms 33808 KB ans=NO N=64333
3 Incorrect 314 ms 18488 KB Added cell 69310 (151,-121) not reachable from infinity
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4948 KB ans=NO N=1934
2 Correct 7 ms 4308 KB ans=NO N=1965
3 Incorrect 8 ms 4180 KB Added cell 1819 (352,202) not reachable from infinity
4 Halted 0 ms 0 KB -