oj.uz

Submission #405667

# Submission time Handle Problem Language Result Execution time Memory
405667 2021-05-16T16:41:18 Z souvenir_vayne Knjige (COCI20_knjige) C++14
0 / 50
 34 ms 520 KB 
#include<bits/stdc++.h>

using namespace std;

int32_t main() {

    int n;
    cin >> n;

    long long ans = 0;
    for(int i = 0; i < n; i++)
        ans += 2 * (n - i) + 2*(n - i - 1);
    cout << ans << endl;

    stack<int> left, right;

    for(int i = 0; i < n; i++) {
        int x;
        cin >> x;
        left.push(x);
    }


    int did = 0;


    while(did < n) {

        stack<int> aux;

        int mn = INT_MAX;
        while(!left.empty()) {

            mn = min(mn, left.top());

            aux.push(left.top());
            left.pop();

        }

        left = aux;
        bool taken = false;
        for(int i = 0; i < n - did; i++) {
            if(left.top() == mn && !taken) {
                taken = true;
                cout << "UZMI L L" << endl;
            }
            else {
                cout << "UZMI D L" << endl << "STAVI D D" << endl;
                right.push(left.top());
            }
            left.pop();
        }

        did++;
        cout << "STAVI L L" << endl;


        while(!right.empty()) {
            cout << "UZMI D D" << endl << "STAVI D L" << endl;
            left.push(right.top());
            right.pop();
        }

    }

}

Subtask #1
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 472 KB Wrong configuration
2 Incorrect 33 ms 520 KB Wrong configuration
3 Incorrect 32 ms 460 KB Wrong configuration
4 Incorrect 32 ms 384 KB Wrong configuration
5 Incorrect 32 ms 460 KB Wrong configuration
6 Incorrect 34 ms 404 KB Wrong configuration
7 Incorrect 32 ms 392 KB Wrong configuration
8 Incorrect 33 ms 452 KB Wrong configuration
9 Incorrect 32 ms 424 KB Wrong configuration
10 Incorrect 32 ms 416 KB Wrong configuration