Submission #145955

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
145955	2019-08-21T12:55:36 Z	Blagojce	Zalmoxis (BOI18_zalmoxis)	C++11	50 / 100	413 ms	14304 KB

zalmoxis

#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x),end(x)

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
ll const inf = 1e9;
ll const mod = 998244853;
ld const eps = 1e-9;


bool f(pii A, pii B){
        if(A.st < B.st) return true;
        else if(A.st > B.st) return false;
        else  A.nd > B.nd;
}
int k;
void expand(int num){
        if(num == 0){
                cout << 0 <<' ';
                return;
        }
        if(k == 0){
                cout << num <<' ';
                return;
        }
        --k;
        expand(num - 1);
        expand(num - 1);


}
int main()
{
        int n;
        cin >> n >> k;
        int a[n];
        int b[n];
        int MIN = 40;
        int nxt[n];
        fr(i, 0, n){
                cin >> a[i];
                b[i] = a[i];
                MIN = min(a[i], MIN);
                nxt[i] = i + 1;
        }
        nxt[n - 1] = n;
        vector<pii> v;
        int sz = n;
        fr(mi, MIN, 30){
                int p = 0;
                int CNT = 0;
                while(1){
                        if(p == n){
                                break;
                        }
                        if(nxt[p] == n){
                                if(a[p] == mi){
                                        v.pb({p, mi});
                                        a[p] ++;
                                }

                        }
                        else if(a[p] == mi){
                                if(a[nxt[p]] == mi){
                                        a[p] = mi + 1;
                                        nxt[p] = nxt[nxt[p]];
                                        CNT ++;
                                }
                                else{
                                        v.pb({p, mi});
                                        a[p] = mi + 1;
                                }
                        }
                        p = nxt[p];
                }
                sz -= CNT;
                p = 0;
        }

        sort(v.begin(), v.end(), f);

        int j = 0;
        k -= (int)v.size();
        if(k < 0) cout << 2 / 0 << endl;
        fr(i, 0, n){
                while(j < v.size() && v[j].st == i){
                        expand(v[j].nd);
                        j ++;
                }
                cout << b[i] <<' ';
        }     
        if(k != 0) cout << 2 / 0 << endl;

        cout <<endl;

        return 0;
}

Compilation message

zalmoxis.cpp: In function 'bool f(pii, pii)':
zalmoxis.cpp:21:20: warning: statement has no effect [-Wunused-value]
         else  A.nd > B.nd;
                    ^
zalmoxis.cpp: In function 'int main()':
zalmoxis.cpp:91:29: warning: division by zero [-Wdiv-by-zero]
         if(k < 0) cout << 2 / 0 << endl;
                           ~~^~~
zalmoxis.cpp:93:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 while(j < v.size() && v[j].st == i){
                       ~~^~~~~~~~~~
zalmoxis.cpp:99:30: warning: division by zero [-Wdiv-by-zero]
         if(k != 0) cout << 2 / 0 << endl;
                            ~~^~~
zalmoxis.cpp: In function 'bool f(pii, pii)':
zalmoxis.cpp:22:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	397 ms	14104 KB	Output is correct
2	Correct	399 ms	14132 KB	Output is correct
3	Correct	413 ms	14104 KB	Output is correct
4	Correct	399 ms	14212 KB	Output is correct
5	Correct	406 ms	14188 KB	Output is correct
6	Correct	398 ms	14304 KB	Output is correct

Subtask #2

20.0 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	393 ms	14128 KB	not a zalsequence
2	Correct	397 ms	14076 KB	Output is correct
3	Correct	410 ms	14152 KB	Output is correct
4	Incorrect	405 ms	14172 KB	not a zalsequence
5	Correct	397 ms	14136 KB	Output is correct
6	Correct	397 ms	14136 KB	Output is correct
7	Incorrect	395 ms	14204 KB	not a zalsequence
8	Incorrect	397 ms	14200 KB	not a zalsequence
9	Incorrect	365 ms	13060 KB	not a zalsequence
10	Incorrect	214 ms	7052 KB	not a zalsequence
11	Incorrect	273 ms	9572 KB	not a zalsequence
12	Incorrect	101 ms	2300 KB	not a zalsequence
13	Incorrect	105 ms	2424 KB	not a zalsequence
14	Incorrect	101 ms	2324 KB	not a zalsequence