제출 #107309

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
107309		abil	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	0 / 100	10 ms	6676 KiB

skyscraper

#include <bits/stdc++.h>

#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
#define Scan(a) scanf ("%I64d", &a)
#define scan(a) scanf ("%d", &a)
#define int long long

using namespace std;

const int inf = (int)1e9 + 7;
const int N = (int)2e5 + 7;

priority_queue<pair<int,int >> q;
int b[N], p[N], vis[N];
vector<int > v[N];
main () {
      int n, m;
      cin >> n >> m;
      for(int i = 1;i <= m; i++){
            cin >> b[i] >> p[i];
            v[b[i]].pb(p[i]);
      }
      memset(vis, 0x3f3f3f3f, sizeof(vis));
      vis[b[1]] = 0;
      q.push(mk(0,b[1]));
      while(!q.empty()){
          pair<int,int > u = q.top();
          q.pop();
          for(auto i : v[u.sc]){
            int cnt = u.fr;
            for(int j = u.sc + i; j < n; j += i){
                  if(vis[j] > ++cnt){
                        q.push(mk(vis[j] = cnt,j));
                  }
            }
            cnt = u.fr;
            for(int j = u.sc - i; j >= 0; j -= i){
                  if(vis[j] > ++cnt){
                        q.push(mk(vis[j] = cnt,j));
                  }
            }
          }
      }
      int ans = 0;
      for(int i = 1;i <= m; i++){
            ans = max(ans,vis[b[i]]);
      }
      cout << ((ans == 0x3f3f3f3f) ? -1 : ans);
}

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

skyscraper.cpp:21:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

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