제출 #378756

#제출 시각아이디문제언어결과실행 시간메모리
378756casperwangGift (IZhO18_nicegift)C++14
30 / 100
2073 ms244452 KiB
#include <bits/stdc++.h> #define pb emplace_back #define pii pair<int,int> #define ff first #define ss second #define All(x) x.begin(), x.end() using namespace std; #define debug(args...) kout("[ " + string(#args) + " ]", args) void kout() { cerr << endl; } template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); } template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; } struct Node { int X; vector <int> I; Node(int x) { X = x; } }; const int MAXN = 1000000; int N, K; int v; vector <Node> ops; bool flag = true; set <pii> now; signed main() { ios_base::sync_with_stdio(0), cin.tie(0); cin >> N >> K; for (int i = 0; i < N; i++) { cin >> v; now.insert(pii(v, i+1)); } while (now.size()) { if (now.size() < K) { flag = false; break; } auto it = prev(now.end()); ops.pb(1); vector <pii> tmp; // debug(now.size()); for (int i = 0; i < K; i++) { // debug(it->ff, it->ss); ops[ops.size()-1].I.pb(it->ss); tmp.pb(*it); if (i+1 < K) { it = prev(now.erase(it)); } else { now.erase(it); } } for (pii i : tmp) { if (i.ff - 1) now.insert(pii(i.ff-1, i.ss)); } } if (flag) { cout << ops.size() << '\n'; for (Node now : ops) { cout << now.X; for (int i : now.I) cout << ' ' << i; cout << '\n'; } } else { cout << -1 << '\n'; } }

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

nicegift.cpp: In function 'int main()':
nicegift.cpp:36:18: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |   if (now.size() < K) {
      |       ~~~~~~~~~~~^~~
#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...