제출 #1040342

#제출 시각아이디문제언어결과실행 시간메모리
1040342NguyenhuutamHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
8 / 100
3078 ms13116 KiB
#include <bits/stdc++.h> using namespace std; int a[1000005]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; while (m--) { int l, r, w; cin >> l >> r >> w; vector<int> b(r - l + 1); for (int j = 0; j < r - l + 1; j++) { b[j] = a[l + j]; } vector<int> c = b; sort(c.begin(), c.end()); bool res = true; for (int j = 0; j < c.size(); j++) { if (b[j] != c[j]) { int pos = find(b.begin() + j, b.end(), c[j]) - b.begin(); for (int k = pos; k > j; k--) { if (b[k] + b[k - 1] <= w) swap(b[k], b[k - 1]); else { res = false; break; } } if (!res) break; } } if (res) cout << 1 << '\n'; else cout << 0 << '\n'; } return 0; }

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

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:31:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |         for (int j = 0; j < c.size(); j++)
      |                         ~~^~~~~~~~~~
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...