oj.uz

답안 #89510

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
89510 2018-12-15T07:22:27 Z RAkhshon Gift (IZhO18_nicegift) C++17
18 / 100
 2000 ms 88056 KB 
#include<bits/stdc++.h>
#define ll long long
#define fr first
#define se second
using namespace std;
set< pair< ll, ll > > st;
vector< pair<ll,pair< ll, ll> > > ans;
int main(){
ll n, k;
cin>>n>>k;
for( ll i =1 ; i <= n ; i ++ ){
    ll x;
    cin>>x;
    st.insert({x,i});
}
/***
std::pair<ll,ll> x;
x=*st.rbegin();
st.erase(x);
***/
while(st.size()>1){
        std::pair< ll , ll > x;
        x=*st.rbegin();
        st.erase(*st.rbegin());
        std::pair< ll , ll > y;
        y=*st.rbegin();
        st.erase(*st.rbegin());
        if( x.fr-1 != 0 ) st.insert({x.fr-1,x.se});
        if( y.fr-1 != 0 ) st.insert({y.fr-1,y.se});
        ans.push_back({1,{x.se,y.se}});
}
if( st.size() == 1 ){
    cout<<-1;
    return 0;
}
cout<<ans.size()<<endl;
for( ll i = 0; i < ans.size(); i  ++ ){
    cout<<ans[i].fr<<' '<<ans[i].se.fr<<' '<<ans[i].se.se<<endl;
}
}

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:37:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for( ll i = 0; i < ans.size(); i  ++ ){
                ~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 492 KB n=3
3 Correct 2 ms 584 KB n=3
4 Correct 2 ms 608 KB n=4
5 Correct 2 ms 608 KB n=4
6 Correct 2 ms 608 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 492 KB n=3
3 Correct 2 ms 584 KB n=3
4 Correct 2 ms 608 KB n=4
5 Correct 2 ms 608 KB n=4
6 Correct 2 ms 608 KB n=2
7 Correct 2 ms 608 KB n=5
8 Correct 4 ms 1000 KB n=8
9 Correct 31 ms 1060 KB n=14
10 Correct 19 ms 1060 KB n=11
11 Correct 140 ms 5676 KB n=50000
12 Correct 139 ms 5676 KB n=50000
13 Correct 99 ms 5676 KB n=10
14 Correct 92 ms 5676 KB n=685
15 Correct 101 ms 5676 KB n=623
16 Correct 58 ms 5676 KB n=973

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 492 KB n=3
3 Correct 2 ms 584 KB n=3
4 Correct 2 ms 608 KB n=4
5 Correct 2 ms 608 KB n=4
6 Correct 2 ms 608 KB n=2
7 Correct 2 ms 608 KB n=5
8 Correct 4 ms 1000 KB n=8
9 Correct 31 ms 1060 KB n=14
10 Correct 19 ms 1060 KB n=11
11 Correct 140 ms 5676 KB n=50000
12 Correct 139 ms 5676 KB n=50000
13 Correct 99 ms 5676 KB n=10
14 Correct 92 ms 5676 KB n=685
15 Correct 101 ms 5676 KB n=623
16 Correct 58 ms 5676 KB n=973
17 Incorrect 111 ms 5676 KB Taken too much stones from the heap
18 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

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

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 492 KB n=3
3 Correct 2 ms 584 KB n=3
4 Correct 2 ms 608 KB n=4
5 Correct 2 ms 608 KB n=4
6 Correct 2 ms 608 KB n=2
7 Correct 2 ms 608 KB n=5
8 Correct 4 ms 1000 KB n=8
9 Correct 31 ms 1060 KB n=14
10 Correct 19 ms 1060 KB n=11
11 Correct 140 ms 5676 KB n=50000
12 Correct 139 ms 5676 KB n=50000
13 Correct 99 ms 5676 KB n=10
14 Correct 92 ms 5676 KB n=685
15 Correct 101 ms 5676 KB n=623
16 Correct 58 ms 5676 KB n=973
17 Incorrect 111 ms 5676 KB Taken too much stones from the heap
18 Halted 0 ms 0 KB -