oj.uz

Submission #263943

# Submission time Handle Problem Language Result Execution time Memory
263943 2020-08-14T04:25:44 Z 임성재(#5088) Teams (CEOI11_tea) C++17
30 / 100
 464 ms 82708 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false); cin.tie(0);
#define pre(a) cout << fixed; cout.precision(a);
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define mp make_pair

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int inf = 1e9;
const ll INF = 1e18;

int n;
vector<pii> v;
vector<vector<int>> ans;
vector<int> x;
priority_queue<pii, vector<pii>, greater<pii>> pQ;

int main() {
	fast;

	cin >> n;

	for(int i=1; i<=n; i++) {
		int s;
		cin >> s;

		v.eb(s, i);
	}

	sort(all(v));
	reverse(all(v));

	int l = v.size();

	for(int i=0; i < v.size(); i += v[i].fi) {
		if(i + v[i].fi > v.size()) {
			l = i;
			break;
		}

		ans.eb(x);
		for(int j=i; j < i + v[i].fi && j < v.size(); j++) {
			ans.back().eb(v[j].se);
		}

		pQ.em(ans.back().size(), ans.size()-1);
	}

	for(int i=l; i<v.size(); i++) {
		auto j = pQ.top();
		pQ.pop();

		ans[j.se].eb(v[i].se);

		pQ.em(j.fi+1, j.se);
	}

	cout << ans.size() << "\n";
	for(auto i : ans) {
		cout << i.size() << " ";
		for(auto j : i) {
			cout << j << " ";
		}
		cout << "\n";
	}
}

Compilation message

tea.cpp: In function 'int main()':
tea.cpp:42:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |  for(int i=0; i < v.size(); i += v[i].fi) {
      |               ~~^~~~~~~~~~
tea.cpp:43:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |   if(i + v[i].fi > v.size()) {
      |      ~~~~~~~~~~~~^~~~~~~~~~
tea.cpp:49:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |   for(int j=i; j < i + v[i].fi && j < v.size(); j++) {
      |                                   ~~^~~~~~~~~~
tea.cpp:56:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |  for(int i=l; i<v.size(); i++) {
      |               ~^~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 544 KB Output is correct
2 Correct 2 ms 512 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 1944 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 2160 KB Output is correct
2 Correct 23 ms 2288 KB Output is correct
3 Correct 26 ms 2544 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 215 ms 14848 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 20004 KB Output is correct
2 Correct 464 ms 82708 KB Output is correct
3 Incorrect 299 ms 25148 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 21228 KB Output is correct
2 Correct 285 ms 30932 KB Output is correct
3 Incorrect 285 ms 23764 KB Output isn't correct
4 Halted 0 ms 0 KB -