oj.uz

답안 #501017

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
501017 2022-01-02T07:54:42 Z dostigator Gift (IZhO18_nicegift) C++17
7 / 100
 173 ms 29476 KB 
// author lox:(
#pragma GCC optimize("O3")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
using namespace std;
#define popcnt __builtin_popcount
#define all(a) a.begin(),a.end()
#define low_b lower_bound
#define up_b upper_bound
#define vii vector<pair<ll,ll>>
#define vll vector<pair<ll,ll>>
#define pii pair<ll,ll>
#define mii map<ll,ll>
#define pll pair<ll,ll>
#define mll map<ll,ll>
#define vi vector<ll>
#define vl vector<ll>
#define pb push_back
#define endl '\n'
#define Y second
#define X first
typedef long double ld;
typedef long long ll;
const ll dx[4]={1,-1,0,0},dy[4]={0,0,1,-1},col=107,N=3e6+777;
const ll mod=1e9+7,inf=1e18;
void fre_open(){freopen("file.in","r",stdin);freopen("file.out","w",stdout);}
ll binpow(ll n,ll k){if(k<0)return 0ll;if(k==0)return 1ll;if(k%2)return (binpow(n,k-1)*n)%mod;ll kk=binpow(n,k/2)%mod;return (kk*kk)%mod;}
void solve(){
	int n,k,sum=0;
	cin>>n>>k;
	pii a[n+2];
	for(int i=1; i<=n; ++i){
        cin>>a[i].X;
        a[i].Y=i;
        sum+=a[i].X;
	}
	sort(a+1,a+1+n);
	if(sum%k) {cout<<"-1\n";return;}
	cout<<sum/2<<endl;
	for(int i=1; i<=sum/2; ++i){
		cout<<"1 "<<a[n].Y<<' '<<a[n-1].Y<<endl;
		a[n].X--;
		a[n-1].X--;
		sort(a+1,a+1+n);
	}
}
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //fre_open
    ll tt=1;
    //cin>>tt;
    while(tt--) solve();
}

Compilation message

nicegift.cpp: In function 'void fre_open()':
nicegift.cpp:26:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 | void fre_open(){freopen("file.in","r",stdin);freopen("file.out","w",stdout);}
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
nicegift.cpp:26:53: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 | void fre_open(){freopen("file.in","r",stdin);freopen("file.out","w",stdout);}
      |                                              ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB n=4
2 Correct 0 ms 312 KB n=3
3 Correct 0 ms 204 KB n=3
4 Correct 1 ms 256 KB n=4
5 Correct 0 ms 316 KB n=4
6 Correct 0 ms 204 KB n=2
7 Correct 0 ms 316 KB n=5
8 Incorrect 6 ms 504 KB Taken too much stones from the heap
9 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB n=4
2 Correct 0 ms 312 KB n=3
3 Correct 0 ms 204 KB n=3
4 Correct 1 ms 256 KB n=4
5 Correct 0 ms 316 KB n=4
6 Correct 0 ms 204 KB n=2
7 Correct 0 ms 316 KB n=5
8 Incorrect 6 ms 504 KB Taken too much stones from the heap
9 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 173 ms 29476 KB Not all heaps are empty in the end
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 312 KB n=3
3 Correct 0 ms 204 KB n=3
4 Correct 1 ms 256 KB n=4
5 Correct 0 ms 316 KB n=4
6 Correct 0 ms 204 KB n=2
7 Correct 0 ms 316 KB n=5
8 Incorrect 6 ms 504 KB Taken too much stones from the heap
9 Halted 0 ms 0 KB -