Submission #933720

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
933720	2024-02-26T07:41:27 Z	pan	Knjige (COCI20_knjige)	C++17	0 / 50	15 ms	984 KB

Main

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
vector<string> ans;
void act(bool take, bool hand, bool from)
{
	string x = "";
	if (take) x+="UZMI ";
	else x+= "STAVI ";
	
	if (hand) x+= "D ";
	else x+= "L ";
	
	if (from) x+= "D";
	else x+= "L";
	ans.pb(x);
	
}
int main()
{
	ll n, d;
	input(n);
	deque<ll> left, right;
	for (ll i=0; i<n; ++i) {input(d); left.pb(d);}
	while (left.size())
	{
		act(1, 0, 0);
		ll now = left.front();
		left.pop_front();
		ll counter = 0;
		while (right.size() && right.front()<now)
		{
			act(1,1, 1);
			act(0,1, 0);
			left.push_front(right.front());
			right.pop_front();
			counter++;
		}
		act(0, 0, 1);
		right.push_front(now);
		for (ll i=0; i<counter; ++i)
		{
			act(1, 1, 0);
			act(0,1, 1);
			right.push_front(left.front());
			left.pop_front();
		}
		
	}
	for (ll i=0; i<n; ++i) {act(1,1, 1); act(0,1, 0);}
	//for (ll i=0; i<n; ++i) show(right[i]);
	print(ll(ans.size()), '\n');
	for (string u: ans) cout << u << endl;
	
	
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | #define input(x) scanf("%lld", &x);
      |                  ~~~~~^~~~~~~~~~~~
Main.cpp:48:2: note: in expansion of macro 'input'
   48 |  input(n);
      |  ^~~~~
Main.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | #define input(x) scanf("%lld", &x);
      |                  ~~~~~^~~~~~~~~~~~
Main.cpp:50:26: note: in expansion of macro 'input'
   50 |  for (ll i=0; i<n; ++i) {input(d); left.pb(d);}
      |                          ^~~~~

Subtask #1

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	13 ms	980 KB	Wrong configuration
2	Incorrect	15 ms	984 KB	Wrong configuration
3	Incorrect	12 ms	984 KB	Wrong configuration
4	Incorrect	13 ms	984 KB	Wrong configuration
5	Incorrect	12 ms	980 KB	Wrong configuration
6	Incorrect	12 ms	984 KB	Wrong configuration
7	Incorrect	5 ms	604 KB	Wrong configuration
8	Incorrect	13 ms	984 KB	Wrong configuration
9	Incorrect	10 ms	984 KB	Wrong configuration
10	Incorrect	15 ms	980 KB	Wrong configuration