oj.uz

Submission #118248

# Submission time Handle Problem Language Result Execution time Memory
118248 2019-06-18T12:44:27 Z eriksuenderhauf Type Printer (IOI08_printer) C++11
100 / 100
 256 ms 99696 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 5;
const double eps = 1e-9;
char str[30];

struct node {
	map<char,node*> children;
	set<pair<int,char>> nx;
	int depth = 0;
	bool fl = 0;
};

int ans = -1;
vector<char> ret;

int dfs(node *&root) {
	ans++;
	if (root->children.empty())
		return root->depth;
	int depth = root->depth;
	for (auto it: root->children) {
		int val = dfs(it.se);
		depth = max(depth, val);
		root->nx.insert(mp(val, it.fi));
	}
	return depth;
}

void solve(node *&root) {
	if (root->fl)
		ret.pb('P');
	if (root->children.empty()) {
		ret.pb('-');
		return;
	}
	for (auto it: root->nx) {
		ret.pb(it.se);
		solve(root->children[it.se]);
	}
	ret.pb('-');
}

node* root = new node;

void ins() {
	node* cur = root;
	int n = strlen(str);
	for (int i = 0; i < n; i++) {
		if (!cur->children.count(str[i]))
			cur->children[str[i]] = new node;
		cur->depth = i;
		cur = cur->children[str[i]];
	}
	cur->depth = n;
	cur->fl = 1;
}

int main() {
	int n;
	ni(n);
	for (int i = 0; i < n; i++) {
		scanf("%s", str);
		ins();
	}
	int mx = dfs(root);
	//pri(2 * ans - mx);
	solve(root);
	while (ret.back() == '-')
		ret.pop_back();
	pri((int)ret.size());
	for (int i = 0; i < (int)ret.size(); i++)
		printf("%c\n", ret[i]);
    return 0;
}

Compilation message

printer.cpp: In function 'int main()':
printer.cpp:98:6: warning: unused variable 'mx' [-Wunused-variable]
  int mx = dfs(root);
      ^~
printer.cpp:9:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
printer.cpp:93:2: note: in expansion of macro 'ni'
  ni(n);
  ^~
printer.cpp:95:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", str);
   ~~~~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 12 ms 384 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 1224 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1920 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 6004 KB Output is correct
2 Correct 32 ms 12584 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 14840 KB Output is correct
2 Correct 14 ms 3456 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 36596 KB Output is correct
2 Correct 211 ms 83692 KB Output is correct
3 Correct 122 ms 43236 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 28756 KB Output is correct
2 Correct 256 ms 99696 KB Output is correct
3 Correct 143 ms 49056 KB Output is correct
4 Correct 193 ms 93988 KB Output is correct