oj.uz

Submission #495212

# Submission time Handle Problem Language Result Execution time Memory
495212 2021-12-18T06:40:25 Z mansur Gift (IZhO18_nicegift) C++14
18 / 100
 2000 ms 379524 KB 
#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")

//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
 
const int inf = 1e9, N = 1e5 + 1, mod = 998244353;                    

vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	int n, k;
	cin >> n >> k;
	int a[n + 1];
	for (int i = 1; i <= n; i++) cin >> a[i];
	multiset<pii> s;
	for (int i = 1; i <= n; i++) {
		s.insert({a[i], i});
	}
	vector<vector<pii>> ans;
	while (sz(s) >= k) {
		pii y = *--s.end();
		s.erase(--s.end());
		vector<pii> pos;
		while (sz(pos) + 1 < k) {
			pii x = *s.begin();
			x.ff--;
			pos.pb(x);
			s.erase(s.begin());
		}
		y.ff--;
		pos.pb(y);
		ans.pb(pos);
		for (auto e: pos) {
			if (e.ff) {
				s.insert(e);
			}
		}
	}
	if (sz(s)) cout << -1, E;
	cout << sz(ans) << nl;
	for (auto e: ans) {
		cout << 1 << ' ';
		for (auto x: e) cout << x.ss << ' ';
		cout << nl;
	}
}

Compilation message

nicegift.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
nicegift.cpp:33:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   33 | main() {
      | ^~~~
nicegift.cpp: In function 'int main()':
nicegift.cpp:47:15: warning: comparison of integer expressions of different signedness: 'std::multiset<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   47 |  while (sz(s) >= k) {
      |               ^
nicegift.cpp:51:22: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |   while (sz(pos) + 1 < k) {
      |                      ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n=4
2 Correct 0 ms 204 KB n=3
3 Correct 1 ms 204 KB n=3
4 Correct 1 ms 204 KB n=4
5 Correct 0 ms 204 KB n=4
6 Correct 0 ms 204 KB n=2

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n=4
2 Correct 0 ms 204 KB n=3
3 Correct 1 ms 204 KB n=3
4 Correct 1 ms 204 KB n=4
5 Correct 0 ms 204 KB n=4
6 Correct 0 ms 204 KB n=2
7 Correct 0 ms 204 KB n=5
8 Correct 2 ms 844 KB n=8
9 Correct 7 ms 1132 KB n=14
10 Correct 5 ms 836 KB n=11
11 Correct 41 ms 4984 KB n=50000
12 Correct 58 ms 5024 KB n=50000
13 Correct 24 ms 3448 KB n=10
14 Correct 23 ms 3064 KB n=685
15 Correct 26 ms 3228 KB n=623
16 Correct 18 ms 1984 KB n=973

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n=4
2 Correct 0 ms 204 KB n=3
3 Correct 1 ms 204 KB n=3
4 Correct 1 ms 204 KB n=4
5 Correct 0 ms 204 KB n=4
6 Correct 0 ms 204 KB n=2
7 Correct 0 ms 204 KB n=5
8 Correct 2 ms 844 KB n=8
9 Correct 7 ms 1132 KB n=14
10 Correct 5 ms 836 KB n=11
11 Correct 41 ms 4984 KB n=50000
12 Correct 58 ms 5024 KB n=50000
13 Correct 24 ms 3448 KB n=10
14 Correct 23 ms 3064 KB n=685
15 Correct 26 ms 3228 KB n=623
16 Correct 18 ms 1984 KB n=973
17 Incorrect 13 ms 2032 KB Jury has the answer but participant has not
18 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2096 ms 379524 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n=4
2 Correct 0 ms 204 KB n=3
3 Correct 1 ms 204 KB n=3
4 Correct 1 ms 204 KB n=4
5 Correct 0 ms 204 KB n=4
6 Correct 0 ms 204 KB n=2
7 Correct 0 ms 204 KB n=5
8 Correct 2 ms 844 KB n=8
9 Correct 7 ms 1132 KB n=14
10 Correct 5 ms 836 KB n=11
11 Correct 41 ms 4984 KB n=50000
12 Correct 58 ms 5024 KB n=50000
13 Correct 24 ms 3448 KB n=10
14 Correct 23 ms 3064 KB n=685
15 Correct 26 ms 3228 KB n=623
16 Correct 18 ms 1984 KB n=973
17 Incorrect 13 ms 2032 KB Jury has the answer but participant has not
18 Halted 0 ms 0 KB -