Submission #472125

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
472125	2021-09-13T06:28:47 Z	abc864197532	Knjige (COCI20_knjige)	C++17	0 / 50	34 ms	1484 KB

Main

/*
 *   ##   #####   ####      ####  #    #  ####
 *  #  #  #    # #    #    #    # #    # #    #
 * #    # #####  #         #    # #    # #    #
 * ###### #    # #         #    # # ## # #    #
 * #    # #    # #    #    #    # ##  ## #    #
 * #    # #####   ####      ####  #    #  ####
 */
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define info() cout << __PRETTY_FUNCTION__ << ": " << __LINE__ << endl
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.X >> a.Y;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.X << ", " << a.Y << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    if (a.empty) o << '{';
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}
template <typename T> struct vv : vector <vector <T>> {
    vv(int n, int m, T v) : vector <vector <T>> (n, vector <T>(m, v)) {}
    vv() {}
};
template <typename T> struct vvv : vector <vv <T>> {
    vvv(int n, int m, int k, T v) : vector <vv <T>> (n, vv <T>(m, k, v)) {}
    vvv() {}
};
#ifdef Doludu
#define test(args...) info(), abc("[" + string(#args) + "]", args)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(args...) void(0)
#define owo ios::sync_with_stdio(false); cin.tie(0)
#endif
const int mod = 1e9 + 7, N = 200001, logN = 20, K = 80000;

int main () {
    owo;
    int n;
    cin >> n;
    vector <int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector <int> p(n);
    iota(all(p), 0);
    sort(all(p), [&](int i, int j) {
        return a[i] > a[j];
    });
    vector <string> ans;
    vector <bool> vis(n, false);
    int res = 0;
    for (int i : p) {
        for (int j = 0; j < n; ++j) if (!vis[j]) {
            if (j != i) {
                ans.pb("UZMI L L");
                ans.pb("STAVI L R");
            } else {
                ans.pb("UZMI L R");
            }
        }
        ans.pb("STAVI R L");
        vis[i] = true;
        for (int j = 0; j < n; ++j) if (!vis[j]) {
            ans.pb("IZML R L");
            ans.pb("STAVI L L");
        }
    }
    cout << ans.size() << endl;
    for (string s : ans) cout << s << endl;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:72:9: warning: unused variable 'res' [-Wunused-variable]
   72 |     int res = 0;
      |         ^~~

Subtask #1

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	32 ms	1484 KB	Token "R" doesn't correspond to pattern "(L|D)"
2	Incorrect	33 ms	1484 KB	Token "R" doesn't correspond to pattern "(L|D)"
3	Incorrect	32 ms	1484 KB	Token "R" doesn't correspond to pattern "(L|D)"
4	Incorrect	32 ms	1484 KB	Token "R" doesn't correspond to pattern "(L|D)"
5	Incorrect	33 ms	1484 KB	Token "R" doesn't correspond to pattern "(L|D)"
6	Incorrect	34 ms	1484 KB	Token "R" doesn't correspond to pattern "(L|D)"
7	Incorrect	32 ms	1484 KB	Token "R" doesn't correspond to pattern "(L|D)"
8	Incorrect	33 ms	1484 KB	Token "R" doesn't correspond to pattern "(L|D)"
9	Incorrect	33 ms	1484 KB	Token "R" doesn't correspond to pattern "(L|D)"
10	Incorrect	32 ms	1484 KB	Token "R" doesn't correspond to pattern "(L|D)"