oj.uz

Submission #89525

# Submission time Handle Problem Language Result Execution time Memory
89525 2018-12-15T08:31:39 Z RAkhshon Gift (IZhO18_nicegift) C++17
30 / 100
 2000 ms 87948 KB 
#include<bits/stdc++.h>
#define ll long long
#define fr first
#define se second
using namespace std;
set< pair< ll, ll > > st;
vector< ll > ans;
vector< ll > st4;
int main(){
ll n, k, t4=0;
cin>>n>>k;
for( ll i =1 ; i <= n ; i ++ ){
    ll x;
    cin>>x;
    st.insert({x,i});
    st4.push_back(x);
    if( st4.size() > 1 && st4[st4.size()-1] != st4[st4.size()-2] ) t4=1;
}
if( t4 == 0 && k > 2 ){
   cout<<1/0;
    if( st4.size() % k != 0 ) {
        cout<<-1;
        return 0;
    }
    else {
        cout<<n/k<<endl;
        for( ll j = 1; j <= n/k; j ++ ){
        cout<<st4[0]<<' ';
        for(ll i = 1 ; i <= k; i ++ ){
            cout<<i*j<<' ';
        }
        cout<<endl;
        }
    return 0;
    }

}
/***
std::pair<ll,ll> x;
x=*st.rbegin();
st.erase(x);
***/
ans.push_back(-1);
std::vector< pair<ll,ll> > help;
while( st.size()>k-1 ){
        ll t = k;
        ans.push_back(1);
        while( t > 0 ){
        std::pair< ll , ll > x;
        x=*st.rbegin();
        st.erase(*st.rbegin());
        ///cout<<x.fr<<'#'<<x.se<<endl;
        if( x.fr != 1 ) help.push_back({x.fr-1,x.se});
        ans.push_back(x.se);
        t--;
        }
        ///cout<<help.size()<<'!'<<endl;
        if( help.size()  != 0 ){
        for( ll i = help.size()-1 ; i >= 0 ; i -- ) {
            st.insert(help[i]);
        }
        help.clear();
        }
    ///cout<<st.size()<<endl;
}
if( st.size() < k && st.size()!=0  ){
    cout<<-1;
    return 0;
}
cout<<(ans.size()-1)/(k+1)<<endl;
for( ll i = 1; i < ans.size(); i  ++ ){
    cout<<ans[i]<<' ';
    if( (i)%(k+1)==0  ) cout<<endl;

}
}

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:20:11: warning: division by zero [-Wdiv-by-zero]
    cout<<1/0;
          ~^~
nicegift.cpp:45:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 while( st.size()>k-1 ){
        ~~~~~~~~~^~~~
nicegift.cpp:66:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 if( st.size() < k && st.size()!=0  ){
     ~~~~~~~~~~^~~
nicegift.cpp:71:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for( ll i = 1; i < ans.size(); i  ++ ){
                ~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n=4
2 Correct 2 ms 372 KB n=3
3 Correct 2 ms 520 KB n=3
4 Correct 2 ms 520 KB n=4
5 Correct 2 ms 520 KB n=4
6 Correct 2 ms 520 KB n=2

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n=4
2 Correct 2 ms 372 KB n=3
3 Correct 2 ms 520 KB n=3
4 Correct 2 ms 520 KB n=4
5 Correct 2 ms 520 KB n=4
6 Correct 2 ms 520 KB n=2
7 Correct 2 ms 520 KB n=5
8 Correct 4 ms 928 KB n=8
9 Correct 32 ms 1308 KB n=14
10 Correct 21 ms 1308 KB n=11
11 Correct 149 ms 5224 KB n=50000
12 Correct 149 ms 5224 KB n=50000
13 Correct 105 ms 5224 KB n=10
14 Correct 102 ms 5224 KB n=685
15 Correct 104 ms 5224 KB n=623
16 Correct 60 ms 5224 KB n=973

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n=4
2 Correct 2 ms 372 KB n=3
3 Correct 2 ms 520 KB n=3
4 Correct 2 ms 520 KB n=4
5 Correct 2 ms 520 KB n=4
6 Correct 2 ms 520 KB n=2
7 Correct 2 ms 520 KB n=5
8 Correct 4 ms 928 KB n=8
9 Correct 32 ms 1308 KB n=14
10 Correct 21 ms 1308 KB n=11
11 Correct 149 ms 5224 KB n=50000
12 Correct 149 ms 5224 KB n=50000
13 Correct 105 ms 5224 KB n=10
14 Correct 102 ms 5224 KB n=685
15 Correct 104 ms 5224 KB n=623
16 Correct 60 ms 5224 KB n=973
17 Correct 84 ms 5224 KB n=989
18 Correct 28 ms 5224 KB n=563
19 Correct 38 ms 5224 KB n=592
20 Correct 39 ms 5224 KB n=938
21 Correct 34 ms 5224 KB n=747
22 Correct 36 ms 5224 KB n=991

Subtask #4
0 / 19.0

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

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n=4
2 Correct 2 ms 372 KB n=3
3 Correct 2 ms 520 KB n=3
4 Correct 2 ms 520 KB n=4
5 Correct 2 ms 520 KB n=4
6 Correct 2 ms 520 KB n=2
7 Correct 2 ms 520 KB n=5
8 Correct 4 ms 928 KB n=8
9 Correct 32 ms 1308 KB n=14
10 Correct 21 ms 1308 KB n=11
11 Correct 149 ms 5224 KB n=50000
12 Correct 149 ms 5224 KB n=50000
13 Correct 105 ms 5224 KB n=10
14 Correct 102 ms 5224 KB n=685
15 Correct 104 ms 5224 KB n=623
16 Correct 60 ms 5224 KB n=973
17 Correct 84 ms 5224 KB n=989
18 Correct 28 ms 5224 KB n=563
19 Correct 38 ms 5224 KB n=592
20 Correct 39 ms 5224 KB n=938
21 Correct 34 ms 5224 KB n=747
22 Correct 36 ms 5224 KB n=991
23 Execution timed out 2037 ms 87948 KB Time limit exceeded
24 Halted 0 ms 0 KB -