제출 #555865

#제출 시각아이디문제언어결과실행 시간메모리
555865mihnea_tudorRestore Array (RMI19_restore)C++17
100 / 100
593 ms904 KiB
#include <bits/stdc++.h> #define NMAX ((int)5e3) #define INF ((int)1e9) using namespace std; struct edge { int dest, cost; }; int n, m; vector<edge> a[NMAX + 1]; int dist[NMAX + 1]; bool bellmanford() { for (int i = 1; i <= n; ++i) { dist[i] = INF; } dist[0] = 0; for (int cnt = 0; cnt < n; ++cnt) { // Check all edges for (int node = 0; node <= n; ++node) { for (auto it = a[node].begin(); it != a[node].end(); ++it) { edge next = *it; if (dist[node] + next.cost < dist[next.dest]) { dist[next.dest] = dist[node] + next.cost; } } } } for (int node = 0; node <= n; ++node) { for (auto it = a[node].begin(); it != a[node].end(); ++it) { edge next = *it; if (dist[node] + next.cost < dist[next.dest]) { return false; } } } return true; } void add_constraint(int left, int right, int k, int val) { if (val == 0) { a[left - 1].push_back({right, (right - left + 1) - k}); } else { a[right].push_back({left - 1, -((right - left + 1) - (k - 1))}); } } int main(void) { scanf("%d %d", &n, &m); for (int i = 0; i < m; ++i) { int left, right, k, val; scanf("%d %d %d %d", &left, &right, &k, &val); ++left; ++right; add_constraint(left, right, k, val); } for (int i = 1; i <= n; ++i) { a[i - 1].push_back({i, 1}); a[i].push_back({i - 1, 0}); } if (!bellmanford()) { printf("-1\n"); return 0; } for (int i = 1; i <= n; ++i) { printf("%d ", dist[i] - dist[i - 1]); } printf("\n"); return 0; }

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

restore.cpp: In function 'int main()':
restore.cpp:57:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
restore.cpp:60:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |         scanf("%d %d %d %d", &left, &right, &k, &val);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...