oj.uz

Submission #491390

# Submission time Handle Problem Language Result Execution time Memory
491390 2021-12-01T23:14:16 Z Yazan_Alattar Zalmoxis (BOI18_zalmoxis) C++14
0 / 100
 419 ms 58540 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 1000007;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

int n, k, a[M];
vector <int> pos[M];

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> k;
    vector < pair <int,int> > v(n);
    for(int i = 0; i < n; ++i){
        cin >> a[i];
        v[i] = {a[i], i};
    }
    for(int j = 1; j < 30; ++j){
        vector < pair <int,int> > nw;
        int cur = 0;
        for(int i = 0; i < v.size(); ++i){
            if(cur){
                if(nw.back().F != v[i].F){
                    int last = nw.back().S;
                    pos[nw.back().S].pb(j);
                    nw.pop_back();
                    nw.pb({j + 1, last});
                    nw.pb(v[i]);
                    --k;
                }
                else{
                    nw.pop_back();
                    nw.pb({j + 1, v[i].S});
                }
                cur = 0;
            }
            else{
                nw.pb(v[i]);
                cur += (v[i].F == j);
            }
        }
        if(cur){
            --k;
            nw.pop_back();
            nw.pb({j + 1, v.back().S});
            pos[nw.back().S].pb(j);
        }
        v = nw;
    }
    int cur = 0;
    for(int i = 0; i < n; ++i){
        cout << a[i] << " ";
        for(auto j : pos[i]){
//            if(k > 0){
//                cout << j - 1 << " ";
//                --k;
//                int cur = j - 1;
//                while(k > 0){
//                    if(cur == 1) break;
//                    cout << --cur << " ";
//                    --k;
//                }
//                cout << cur << " ";
//            }
            cout << j << " ";
        }
    }
    cout << endl;
    return 0;
}
// Don't forget special cases. (n = 1?)
// Look for the constraints. (Runtime array? overflow?)

Compilation message

zalmoxis.cpp: In function 'int main()':
zalmoxis.cpp:41:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         for(int i = 0; i < v.size(); ++i){
      |                        ~~^~~~~~~~~~
zalmoxis.cpp:70:9: warning: unused variable 'cur' [-Wunused-variable]
   70 |     int cur = 0;
      |         ^~~

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 372 ms 57068 KB Expected EOF
2 Incorrect 350 ms 56404 KB Expected EOF
3 Incorrect 370 ms 56912 KB Expected EOF
4 Incorrect 366 ms 56776 KB Expected EOF
5 Incorrect 357 ms 56604 KB Expected EOF
6 Incorrect 419 ms 58540 KB Expected EOF

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 394 ms 56904 KB Expected EOF
2 Incorrect 413 ms 57464 KB Expected EOF
3 Incorrect 355 ms 56448 KB Expected EOF
4 Incorrect 356 ms 56556 KB Expected EOF
5 Incorrect 360 ms 56684 KB Expected EOF
6 Incorrect 380 ms 57016 KB Expected EOF
7 Incorrect 359 ms 56588 KB Expected EOF
8 Incorrect 346 ms 56284 KB Expected EOF
9 Incorrect 345 ms 52928 KB Expected EOF
10 Incorrect 149 ms 36400 KB Unexpected end of file - int32 expected
11 Incorrect 248 ms 42664 KB Expected EOF
12 Incorrect 12 ms 23756 KB Unexpected end of file - int32 expected
13 Incorrect 13 ms 23792 KB Unexpected end of file - int32 expected
14 Incorrect 12 ms 23756 KB Unexpected end of file - int32 expected