제출 #1028651

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1028651		vjudge1	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	339 ms	262144 KiB

skyscraper

#include<bits/stdc++.h>

using namespace std;

const int inf = 1e9;

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  
  int n, m;
  cin >> n >> m;
  
  vector<vector<int> > dist(n, vector<int> (m, inf)); 

  vector<int> L[n];
  int p[m], b[m];
  for(int i = 0; i < m; i ++)
    {
      cin >> b[i] >> p[i];
      L[b[i]].push_back(i);
    }

  int cnt[n] = {};
  deque<pair<int,int> > Q;
  Q.push_back({b[0], 0});
  dist[b[0]][0] = 0;
  while(Q.size())
    {
      int f = Q.front().first, s = Q.front().second;
      Q.pop_front();
      if(f == b[1])
	{
	  cout << dist[f][s] << endl;
	  exit(0);
	}
      // cerr << f << ' ' << s << ' ' << dist[f][s] << endl;
      // if(cnt[f] <= 2000) {
	for(int res : L[f])
	  if(dist[f][s] < dist[f][res])
	    {
	      dist[f][res] = dist[f][s];
	      Q.push_front({f, res});
	    }
	// cnt[f]++;
      // }
      
      L[f].clear();
      
      if(f + p[s] < n && dist[f][s] + 1 < dist[f + p[s]][s])
	{
	  dist[f + p[s]][s] = dist[f][s] + 1;
	  Q.push_back({f + p[s], s});
	}

      if(f - p[s] >= 0 && dist[f][s] + 1 < dist[f - p[s]][s])
	{
	  dist[f - p[s]][s] = dist[f][s] + 1;
	  Q.push_back({f - p[s], s});
	}
    }

  cout << -1 << endl;
  return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:25:7: warning: unused variable 'cnt' [-Wunused-variable]
   25 |   int cnt[n] = {};
      |       ^~~

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 14 / 14
• Subtask 4: 21 / 21
• Subtask 5: 0 / 43