제출 #40150

#제출 시각아이디문제언어결과실행 시간메모리
40150alenam0161고대 책들 (IOI17_books)C++14
0 / 100
1 ms3000 KiB
#include "books.h" #include <iostream> using namespace std; const int N = 1e6 + 7; bool used[N]; vector<int> cycl,a; long long ans; void dfs(int v) { used[v] = true; cycl.push_back(v); ans += abs(a[v] - v); if (used[a[v]])return; dfs(a[v]); } long long minimum_walk(std::vector<int> p, int s) { a = p; int n = p.size(); vector<pair<long long,int>> ms; for (int i = 0; i < n; ++i) { if (used[i])continue; ans = 0; cycl.clear(); dfs(i); ms.push_back({ ans,i }); } while (ms.size() > 0 && ms.back().first == 0)ms.pop_back(); long long an = 0; for (int i = 0; i < ms.size(); ++i) { an += ms[i].first;// cout << ms[i].first << " " << ms[i].second << endl; } an += ms.back().second * 2; return an; }

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

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:28:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < ms.size(); ++i) {
                    ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...