제출 #37739

#제출 시각아이디문제언어결과실행 시간메모리
3773914kg등산 경로 (IZhO12_route)C++11
0 / 100
2000 ms22916 KiB
#include <stdio.h> #include <queue> #include <vector> #include <functional> #include <algorithm> #define N 1000001 #define next(x) (x==n?1:x+1) #define before(x) (x==1?n:x-1) using namespace std; typedef pair<int, pair<int, int> > pip; int n, m, in[N]; bool cc[N]; pair<int, int> go1[N], go2[N]; priority_queue<pip, vector<pip>, greater<pip> > Q; int main() { int s, num = -1; int path, x, y, len, tot = 0, tx, ty; bool check; //freopen("input.txt", "r", stdin); scanf("%d %d", &n, &m); for (int i = 1; i <= n; i++) { scanf("%d", &in[i]); if (num < in[i]) num = in[i], s = i; } path = s, len = 0, check = false;; for (int i = next(s); i != s; i = next(i)) { if (in[path] > in[i]) x = i, len = 1, check = true; if (in[path] == in[i]) len++; if (in[path] < in[i] && check) { Q.push({ len,{ x, path } }), check = false; go1[path] = { x,len - 1 }, go2[x] = { path,len - 1 }; } path = i; } if (in[path] < in[s] && check) { Q.push({ len,{ x, path } }); go1[path] = { x,len - 1 }, go2[x] = { path,len - 1 }; } //printf("!"); while ((!Q.empty()) && Q.top().first <= m) { len = Q.top().first, x = Q.top().second.first, y = Q.top().second.second; Q.pop(), m -= len, tot++; in[x]++; if (x != y) in[y]++; tx = x, num = 0, path = len; while (in[before(tx)] == in[tx]) { num++, len++, tx = before(tx); if (go1[tx].second) len += go1[tx].second, tx = go1[tx].first; if (num > n) break; } go1[x] = { tx,len - path }; if (in[before(tx)] == in[tx]) break; if (in[before(tx)] < in[tx]) continue; ty = y, path = len; while (in[ty] == in[next(ty)]) { len++, ty = next(ty); if (go2[ty].second) len += go2[ty].second, ty = go2[ty].first; } go2[y] = { ty,len - path }; if (in[ty] < in[next(ty)]) { Q.push({ len,{ tx,ty } }); go1[ty] = { tx,len - 1 }, go2[tx] = { ty,len - 1 }; } }// printf("!"); printf("%d", tot * 2); //getchar(), getchar(); }

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

route.cpp: In function 'int main()':
route.cpp:24:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
                        ^
route.cpp:26:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &in[i]);
                      ^
route.cpp:41:21: warning: 's' may be used uninitialized in this function [-Wmaybe-uninitialized]
  if (in[path] < in[s] && check) {
                     ^
#Verdict Execution timeMemoryGrader output
Fetching results...