oj.uz

답안 #495089

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495089 2021-12-18T04:40:56 Z mansur Gift (IZhO18_nicegift) C++14
18 / 100
 2000 ms 117152 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];
	if (k == 2) {
		multiset<pii> s;
		for (int i = 1; i <= n; i++) {
			s.insert({a[i], i});
		}
		vector<pii> ans;
		while (sz(s) > 1) {
			pii x = *s.begin(), y = *--s.end();
			s.erase(s.begin());
			s.erase(--s.end());
			x.ff--;
			y.ff--;
			ans.pb({x.ss, y.ss});
			if (x.ff)
				s.insert(x);
			if (y.ff)
				s.insert(y);
		}
		if (sz(s) == 1) cout << -1, E;
		cout << sz(ans) << nl;
		for (auto e: ans) cout << 1 << ' ' << e.ff << ' ' << e.ss << 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() {
      | ^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB n=4
2 Correct 0 ms 204 KB n=3
3 Correct 0 ms 204 KB n=3
4 Correct 0 ms 204 KB n=4
5 Correct 1 ms 204 KB n=4
6 Correct 0 ms 204 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB n=4
2 Correct 0 ms 204 KB n=3
3 Correct 0 ms 204 KB n=3
4 Correct 0 ms 204 KB n=4
5 Correct 1 ms 204 KB n=4
6 Correct 0 ms 204 KB n=2
7 Correct 0 ms 204 KB n=5
8 Correct 1 ms 460 KB n=8
9 Correct 4 ms 588 KB n=14
10 Correct 3 ms 432 KB n=11
11 Correct 28 ms 3608 KB n=50000
12 Correct 28 ms 4168 KB n=50000
13 Correct 15 ms 1132 KB n=10
14 Correct 18 ms 1208 KB n=685
15 Correct 17 ms 1232 KB n=623
16 Correct 11 ms 844 KB n=973

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB n=4
2 Correct 0 ms 204 KB n=3
3 Correct 0 ms 204 KB n=3
4 Correct 0 ms 204 KB n=4
5 Correct 1 ms 204 KB n=4
6 Correct 0 ms 204 KB n=2
7 Correct 0 ms 204 KB n=5
8 Correct 1 ms 460 KB n=8
9 Correct 4 ms 588 KB n=14
10 Correct 3 ms 432 KB n=11
11 Correct 28 ms 3608 KB n=50000
12 Correct 28 ms 4168 KB n=50000
13 Correct 15 ms 1132 KB n=10
14 Correct 18 ms 1208 KB n=685
15 Correct 17 ms 1232 KB n=623
16 Correct 11 ms 844 KB n=973
17 Incorrect 0 ms 208 KB Unexpected end of file - int32 expected
18 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2069 ms 117152 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB n=4
2 Correct 0 ms 204 KB n=3
3 Correct 0 ms 204 KB n=3
4 Correct 0 ms 204 KB n=4
5 Correct 1 ms 204 KB n=4
6 Correct 0 ms 204 KB n=2
7 Correct 0 ms 204 KB n=5
8 Correct 1 ms 460 KB n=8
9 Correct 4 ms 588 KB n=14
10 Correct 3 ms 432 KB n=11
11 Correct 28 ms 3608 KB n=50000
12 Correct 28 ms 4168 KB n=50000
13 Correct 15 ms 1132 KB n=10
14 Correct 18 ms 1208 KB n=685
15 Correct 17 ms 1232 KB n=623
16 Correct 11 ms 844 KB n=973
17 Incorrect 0 ms 208 KB Unexpected end of file - int32 expected
18 Halted 0 ms 0 KB -