oj.uz

답안 #564626

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
564626 2022-05-19T12:14:48 Z Dodo Building Skyscrapers (CEOI19_skyscrapers) C++14
0 / 100
 1455 ms 33912 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];
ll cnt=0;
bool visited[mx];

void dfs (ll x)
{
  cnt++;
  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=1000000000;
    for(int i=0;i<n;i++)
    {
      ll f=b[i].first,s=b[i].second;
      for(int j=0;j<8;j++)
        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
    {
      cout<<"YES"<<endl;
      sort(b.begin(),b.end(),greater<pair<ll,ll>>());

      bool arr[n+1]={};
      cnt=1;
      cout<<mp[b[0]]<<endl;

      arr[mp[b[0]]]=1;
      b.erase(b.begin());

      while(cnt!=n)
      {
        for(int i=0;i<b.size();i++)
        {
          ll f=b[i].first,s=b[i].second;
          if(arr[mp[{f,s}]]==1)continue;
          for(int j=0;j<8;j++)
          {
            if(f+y[j]>lmt||s+x[j]>lmt)continue;
            if(arr[mp[{f+y[j],s+x[j]}]]==1)
            {
              cnt++;
              cout<<mp[{f,s}]<<endl;
              arr[mp[{f,s}]]=1;
              b.erase(b.begin()+i);
              break;
            }
          }
        }
      }
    }
    return 0;
}

Compilation message

skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:65:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |         for(int i=0;i<b.size();i++)
      |                     ~^~~~~~~~~

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 3796 KB ans=NO N=4
4 Correct 2 ms 3796 KB ans=YES N=5
5 Incorrect 2 ms 3796 KB Added cell 8 (1,1) not reachable from infinity
6 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 3796 KB ans=NO N=4
4 Correct 2 ms 3796 KB ans=YES N=5
5 Incorrect 2 ms 3796 KB Added cell 8 (1,1) not reachable from infinity
6 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 3796 KB ans=NO N=4
4 Correct 2 ms 3796 KB ans=YES N=5
5 Incorrect 2 ms 3796 KB Added cell 8 (1,1) not reachable from infinity
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4948 KB ans=NO N=1934
2 Correct 6 ms 4328 KB ans=NO N=1965
3 Incorrect 10 ms 4180 KB Added cell 1824 (365,209) 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 3796 KB ans=NO N=4
4 Correct 2 ms 3796 KB ans=YES N=5
5 Incorrect 2 ms 3796 KB Added cell 8 (1,1) not reachable from infinity
6 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 269 ms 17568 KB ans=NO N=66151
2 Correct 283 ms 33912 KB ans=NO N=64333
3 Incorrect 1455 ms 17620 KB Added cell 69315 (122,-243) 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 6 ms 4328 KB ans=NO N=1965
3 Incorrect 10 ms 4180 KB Added cell 1824 (365,209) not reachable from infinity
4 Halted 0 ms 0 KB -