| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 367955 |
2021-02-19T02:06:38 Z |
Falseee |
Knjige (COCI20_knjige) |
C++17 |
|
53 ms |
1508 KB |
#include <bits/stdc++.h>
using namespace std;
// c++ template (stolen from AmandOza) !
#define MOD (int)1e9+7
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define resz resize
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define L1(u, ...) [&](auto &&u) { return __VA_ARGS__; }
#define L2(u, v, ...) [&](auto &&u, auto &&v) { return __VA_ARGS__; }
#define sort_by(x, y) sort(all(x), [&](const auto &l, const auto &r) { return y; })
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
template <typename T> void ckmin(T &a, const T &b) { a = min(a, b); }
template <typename T> void ckmax(T &a, const T &b) { a = max(a, b); }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void usaco(string filename) {
// #pragma message("be careful, freopen may be wrong")
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
namespace __input {
template <class T1, class T2> void re(pair<T1, T2> &p);
template <class T> void re(vector<T> &a);
template <class T, size_t SZ> void re(array<T, SZ> &a);
template <class T> void re(T &x) { cin >> x; }
void re(double &x) { string t; re(t); x = stod(t); }
template <class Arg, class... Args> void re(Arg &first, Args &...rest) { re(first); re(rest...); }
template <class T1, class T2> void re(pair<T1, T2> &p) { re(p.f, p.s); }
template <class T> void re(vector<T> &a) { F0R (i, sz(a)) re(a[i]); }
template <class T, size_t SZ> void re(array<T, SZ> &a) { F0R (i, SZ) re(a[i]); }
}
using namespace __input;
namespace __output {
template <typename T> struct is_outputtable { template <typename C> static constexpr decltype(declval<ostream &>() << declval<const C &>(), bool()) test(int) { return true; } template <typename C> static constexpr bool test(...) { return false; } static constexpr bool value = test<T>(int()); };
template <class T, typename V = decltype(declval<const T &>().begin()), typename S = typename enable_if<!is_outputtable<T>::value, bool>::type> void pr(const T &x);
template <class T, typename V = decltype(declval<ostream &>() << declval<const T &>())> void pr(const T &x) { cout << x; }
template <class T1, class T2> void pr(const pair<T1, T2> &x);
template <class Arg, class... Args> void pr(const Arg &first, const Args &...rest) { pr(first); pr(rest...); }
template <class T, bool pretty = true> void prContain(const T &x) { if (pretty) pr("{"); bool fst = 1; for (const auto &a : x) pr(!fst ? pretty ? ", " : " " : "", a), fst = 0; if (pretty) pr("}"); }
template <class T> void pc(const T &x) { prContain<T, false>(x); pr("\n"); }
template <class T1, class T2> void pr(const pair<T1, T2> &x) { pr("{", x.f, ", ", x.s, "}"); }
template <class T, typename V, typename S> void pr(const T &x) { prContain(x); }
void ps() { pr("\n"); }
template <class Arg> void ps(const Arg &first) { pr(first); ps(); }
template <class Arg, class... Args> void ps(const Arg &first, const Args &...rest) { pr(first, " "); ps(rest...); }
}
using namespace __output;
#define TRACE(x) x
#define __pn(x) pr(#x, " = ")
#ifdef NOAM_LOCAL
#define pd(...) pr("\033[1;31m"), __pn((__VA_ARGS__)), ps(__VA_ARGS__), pr("\033[0m"), cout << flush
#else
#define pd(...)
#endif
namespace __algorithm {
template <typename T> void dedup(vector<T> &v) { sort(all(v)); v.erase(unique(all(v)), v.end()); }
template <typename T> typename vector<T>::const_iterator find(const vector<T> &v, const T &x) { auto it = lower_bound(all(v), x); return it != v.end() && *it == x ? it : v.end(); }
template <typename T> size_t index(const vector<T> &v, const T &x) { auto it = find(v, x); assert(it != v.end() && *it == x); return it - v.begin(); }
template <typename T1, typename T2> typename vector<pair<T1, T2>>::iterator lower_bound(const vector<pair<T1, T2>> &v, const T1 &x) { return lower_bound(all(v), x, [](pair<T1, T2> a, pair<T1, T2> b) { return a.f < b.f; }); }
template <typename T1, typename T2> typename vector<pair<T1, T2>>::iterator upper_bound(const vector<pair<T1, T2>> &v, const T1 &x) { return upper_bound(all(v), x, [](pair<T1, T2> a, pair<T1, T2> b) { return a.f < b.f; }); }
template <typename I, typename B, typename E> struct reversed { I &v_; explicit reversed(I &v) : v_{v} {} B begin() const { return rbegin(v_); } E end() const { return rend(v_); } };
}
using namespace __algorithm;
struct __monostate {
friend istream &operator>>(istream &is, const __attribute__((unused)) __monostate &ms) { return is; }
friend ostream &operator<<(ostream &os, const __attribute__((unused)) __monostate &ms) { return os; }
} ms;
namespace __io {
void setIn(string s) { freopen(s.c_str(), "r", stdin); }
void setOut(string s) { freopen(s.c_str(), "w", stdout); }
void setIO() { ios_base::sync_with_stdio(0); cin.tie(0); cout << setprecision(15); }
}
using namespace __io;
const int mxN = 0;
int main(){
ios_base::sync_with_stdio();
cin.tie(0);
string prendre = "UZMI", mettre = "STAVI";
cout.tie(0);
int n; cin >> n;
vi ar(n);
re(ar);
// pd(ar);
vi dummy = ar;
sort(all(dummy));
reverse(all(dummy));
int cur;
deque<int> left, right;
F0R(i, n){
left.push_front(ar[i]);
}
vector<int> tries;
int hand_left=-1, hand_right= -1;
vector<string> op;
for(int i = 0; i <n ; ++i){
// cur = dummy[i];
for(int j = 0; j < n-i; ++j){
if(left.front() == dummy[i] && hand_left == -1){ // le haut le l'étagere de gauche est le plus gros qu'on peut avoir
// cout << "happens " << endl;
hand_left = dummy[i];
left.pop_front();
}else{// on doit utiliser la main droite car c'est pas celui qui nous interesse
if(hand_right != -1){
// cout<<"STAVI D D" << endl; // si la main droite est prise, la libere en mettant la brique dans l'étagere droite
op.pb(mettre+" D D");
right.push_front(hand_right); // on met la brique de la main droite dans l'étagere de droite
hand_right = -1;
}
op.pb(prendre+" L D");
hand_right = left.front(); // on pioche unenouvelle brique
left.pop_front();
}
}
if(hand_right !=-1){
op.pb(mettre+" D D"); // si la main droite est prise, la libere en mettant la brique dans l'étagere droite
right.push_front(hand_right);
hand_right = -1;
}
// a la fin, on a juste le plus gros dans la main de droite , l'étagere de gauche a les briques ordonnées en épaisseur mais il en reste dans celle de droite
// donc on veut remettre tout dans létagere de gauche pour que celle de droite soit vide
op.pb(mettre+ " L L");
left.push_front(hand_left);
hand_left = -1;
// cout << "left_back_sorted: " << endl;
// pd(left);
/*
*
12
UZMI L D
STAVI D D
UZMI L D
STAVI D D
UZMI D D
STAVI D L
UZMI D D
STAVI D L
UZMI L D
STAVI D D
UZMI D D
STAVI D L
*/
while(!right.empty()){
op.pb(prendre+" D D");
op.pb(mettre+" D L");
left.push_front(right.front());
right.pop_front();
}
// cout << "left normal : "<< endl;
// pd(left);
}
cout << op.size() << endl;
F0R(i, op.size()){
cout << op[i]<< endl;
}
// cout << endl;
// while(!left.empty()){
// cout <<left.front() << endl;
// left.pop_front();
// }
}
Compilation message
Main.cpp: In function 'int main()':
Main.cpp:23:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
23 | #define F0R(i, a) for (int i = 0; i < (a); i++)
| ^
Main.cpp:213:5: note: in expansion of macro 'F0R'
213 | F0R(i, op.size()){
| ^~~
Main.cpp:140:9: warning: unused variable 'cur' [-Wunused-variable]
140 | int cur;
| ^~~
Main.cpp: In function 'void usaco(std::string)':
Main.cpp:57:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
57 | freopen((filename + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:58:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
58 | freopen((filename + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void __io::setIn(std::string)':
Main.cpp:119:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
119 | void setIn(string s) { freopen(s.c_str(), "r", stdin); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void __io::setOut(std::string)':
Main.cpp:120:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
120 | void setOut(string s) { freopen(s.c_str(), "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
46 ms |
1508 KB |
No book to take |
| 2 |
Incorrect |
46 ms |
1508 KB |
No book to take |
| 3 |
Incorrect |
53 ms |
1508 KB |
No book to take |
| 4 |
Incorrect |
45 ms |
1508 KB |
No book to take |
| 5 |
Incorrect |
46 ms |
1508 KB |
No book to take |
| 6 |
Incorrect |
45 ms |
1508 KB |
No book to take |
| 7 |
Incorrect |
47 ms |
1508 KB |
No book to take |
| 8 |
Incorrect |
45 ms |
1508 KB |
No book to take |
| 9 |
Incorrect |
45 ms |
1508 KB |
No book to take |
| 10 |
Incorrect |
45 ms |
1508 KB |
No book to take |
