oj.uz

Submission #74136

# Submission time Handle Problem Language Result Execution time Memory
74136 2018-08-30T09:22:52 Z jiajunlee Zalmoxis (BOI18_zalmoxis) C++14
0 / 100
 1000 ms 143356 KB 
#include <iostream>
#include <vector>
#include <stack>
#include <set>
 
using namespace std;
 
typedef long long LL;
 
const LL MAXN = 1000050;
 
LL n, k;
LL input[MAXN] = {};
vector<LL> extra[MAXN];
multiset<pair<LL, LL> > Zal;
set<LL> inde;
set<LL>::iterator ii, jj;
 
int main(void) 
{
  cin >> n >> k;
  for(int i0 = 0; i0 < n; i0++)
  {
    cin >> input[i0];
    Zal.insert(make_pair(input[i0], i0));
    inde.insert(i0);
  }
  /****
  while(Zal.begin()->first != 30)
  {
    LL x = Zal.begin()->first, i = Zal.begin()->second;
    //cout << x << "-" << i << " ";
    Zal.erase(Zal.begin());
    LL y = Zal.begin()->first, j = Zal.begin()->second;
    ii = inde.find(i), jj = inde.find(j);
    jj--;
    if(x == y && ii == jj)
    {
      //cout << "Combine" << endl;
      Zal.erase(Zal.begin());
      inde.erase(ii);
      Zal.insert(make_pair(x+1, j));
    }else
    {
      //cout << "Extra" << endl;
      k--;
      extra[i].push_back(x);
      Zal.insert(make_pair(x+1, i));
    }
  }
  ****/
  //cout << k << endl;
  for(LL i = 0; i < n; i++)
  {
    cout << input[i] << " ";
    //cout << "Ya" << endl;
    LL num_Bro = extra[i].size();
    LL idx = 0;
    stack<LL> st;
    for(LL idx = num_Bro-1; idx >= 0; idx--)
    {
      //cout << "Ya" << endl;
      st.push(extra[i][idx]);
    }
    while(!st.empty() && k > 0)
    {
      LL x = st.top();
      st.pop();
      if(x == 1)cout << 1 << " ";
      else
      {
        st.push(x-1);
        st.push(x-1);
        k--;
      }  
    }
    while(!st.empty())
    {
      cout << st.top() << " ";
      st.pop();
    }
    //cout << endl;
  }
  
  return 0;
}

Compilation message

zalmoxis.cpp: In function 'int main()':
zalmoxis.cpp:58:8: warning: unused variable 'idx' [-Wunused-variable]
     LL idx = 0;
        ^~~

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1072 ms 142188 KB Time limit exceeded
2 Execution timed out 1079 ms 142284 KB Time limit exceeded
3 Execution timed out 1091 ms 142932 KB Time limit exceeded
4 Execution timed out 1097 ms 142932 KB Time limit exceeded
5 Execution timed out 1086 ms 142932 KB Time limit exceeded
6 Execution timed out 1080 ms 142932 KB Time limit exceeded

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1094 ms 142932 KB Time limit exceeded
2 Execution timed out 1094 ms 143156 KB Time limit exceeded
3 Execution timed out 1085 ms 143356 KB Time limit exceeded
4 Execution timed out 1086 ms 143356 KB Time limit exceeded
5 Execution timed out 1094 ms 143356 KB Time limit exceeded
6 Execution timed out 1086 ms 143356 KB Time limit exceeded
7 Execution timed out 1089 ms 143356 KB Time limit exceeded
8 Execution timed out 1091 ms 143356 KB Time limit exceeded
9 Execution timed out 1071 ms 143356 KB Time limit exceeded
10 Incorrect 391 ms 143356 KB Unexpected end of file - int32 expected
11 Incorrect 626 ms 143356 KB Unexpected end of file - int32 expected
12 Incorrect 22 ms 143356 KB Unexpected end of file - int32 expected
13 Incorrect 20 ms 143356 KB Unexpected end of file - int32 expected
14 Incorrect 21 ms 143356 KB Unexpected end of file - int32 expected