oj.uz

Submission #1019946

# Submission time Handle Problem Language Result Execution time Memory
1019946 2024-07-11T11:03:03 Z cproko Type Printer (IOI08_printer) C++14
100 / 100
 119 ms 106504 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vec vector
#define PB push_back
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define int long long
#define ull unsigned long long
#define pii pair<int,int>
#define rz resize
#define yes cout << "YES\n"
#define no cout << "NO\n"

const int N = 1e5 + 5;
const ll INF = 1e9 + 5;
const ll MOD = 1e9 + 7;
int n, cnt=0;
string ans;
struct Node {
    Node* child[26];
    int exist;
    bool mark;
    Node() {
        exist=0;
        mark=false;
        for (int i = 0; i < 26; ++i) child[i] = NULL;
    }
};

void insert(string &s, Node* root) {
    Node* cur = root;
    for (char c : s) {
        if (cur->child[c - 'a'] == NULL) {
            cur->child[c - 'a'] = new Node();
        }
        cur = cur->child[c - 'a'];
    }
    cur->exist++;
}

void mark(string &s, Node* root) {
	Node* cur = root;
    for (char c : s) {
        cur = cur->child[c - 'a'];
        cur->mark=true;
    }
}

void dfs1(Node* u) {
	if (u->exist) ans+= 'P';
	for (int i=0; i<26; ++i) {
		if (u->child[i] != NULL) {
			if (u->child[i]->mark) continue;
			ans+= (char)(i+'a');
			dfs1(u->child[i]);
			ans+='-';
		}
	}
	for (int i=0; i<26; ++i) {
		if(u->child[i]==NULL) continue;
		if (u->child[i]->mark) {
			ans+=(char)(i+'a');
			dfs1(u->child[i]);
		}
	}
}

signed main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    Node* root = new Node();
    int n; cin >> n;
    int lge=0;
    string maxS;
    for (int i=0; i<n; ++i) {
    	string s; cin >> s; insert(s, root);
    	if (s.size() > lge) lge=s.size(), maxS=s;
    }
    mark(maxS, root);
    dfs1(root);
    cout << ans.size() << '\n';
    for (char c: ans) cout << c << '\n';

    cerr << "Run!\n";
}

Compilation message

printer.cpp: In function 'int main()':
printer.cpp:79:19: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   79 |      if (s.size() > lge) lge=s.size(), maxS=s;
      |          ~~~~~~~~~^~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6488 KB Output is correct
2 Correct 13 ms 13404 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 15852 KB Output is correct
2 Correct 6 ms 3676 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 38892 KB Output is correct
2 Correct 119 ms 89484 KB Output is correct
3 Correct 49 ms 46100 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 30448 KB Output is correct
2 Correct 117 ms 106504 KB Output is correct
3 Correct 58 ms 52464 KB Output is correct
4 Correct 90 ms 100620 KB Output is correct