oj.uz

Submission #322618

# Submission time Handle Problem Language Result Execution time Memory
322618 2020-11-15T02:57:57 Z mglstew Type Printer (IOI08_printer) C++17
100 / 100
 161 ms 98668 KB 
#include <bits/stdc++.h>
#define MOD 1000000007
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define N 100005
#define ccin cin >>
#define ccout cout <<

using namespace std;

int ans = 0;

struct Node{
  	int last;
  	int is;
  	Node *next[26];
  	Node(){
    	last = false;
    	is = false;
    	for(int i = 0; i < 26; i++){
    		next[i] = NULL;
    	}
  	}
} *root = new Node;

void insert(Node *root, string s){
  	for(int i = 0; i < s.size(); i++){
      	int index = s[i] - 'a';
      	if(root -> next[index] == NULL){
       		root -> next[index] = new Node;
        	ans++;
      	}
      	root = root -> next[index];
  	}
  	root -> last = 1;
}

void search(Node *root, string s){
    for(int i = 0; i < s.size(); i++){
      	int index = s[i] - 'a';
      	root = root -> next[index];
      	root -> is = 1;
    }
    root -> last = 1;
}
void Print(Node *root){
    for(int i = 0; i < 26; i++){
      	if(root -> next[i] != NULL && !root -> next[i] -> is){
            ccout char(i + 'a')<< '\n';
            if(root -> next[i] -> last){
            	ccout "P" << '\n';
            }
            Print(root -> next[i]);
            ccout "-" << '\n';
      	}
    }
}

int n;
string st;

int main()
{
  	ios_base::sync_with_stdio(false);
  	cin.tie(NULL);
  	cout.tie(NULL);
  	ccin n;
  	for(int i = 1; i <= n; i++) {
      	string s;
      	ccin s;
      	insert(root, s);
      	if(s.size() > st.size()) st = s;
  	}
  	search(root, st);
  	ccout ans * 2 + n - st.size() << '\n';
  	Print(root);
  	for(int i = 0; i < st.size(); i++){
      	ccout st[i] << '\n';
      	Print(root -> next[st[i] - 'a']);
      	if(root -> next[st[i] - 'a'] -> last){
      		ccout "P" << '\n';
      	}
      	root = root -> next[st[i] - 'a'];
  }
}

Compilation message

printer.cpp: In function 'void insert(Node*, std::string)':
printer.cpp:29:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |    for(int i = 0; i < s.size(); i++){
      |                   ~~^~~~~~~~~~
printer.cpp: In function 'void search(Node*, std::string)':
printer.cpp:41:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for(int i = 0; i < s.size(); i++){
      |                    ~~^~~~~~~~~~
printer.cpp: In function 'int main()':
printer.cpp:79:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |    for(int i = 0; i < st.size(); i++){
      |                   ~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 2 ms 1132 KB Output is correct

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5868 KB Output is correct
2 Correct 22 ms 12396 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 14572 KB Output is correct
2 Correct 11 ms 3436 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 36332 KB Output is correct
2 Correct 133 ms 83052 KB Output is correct
3 Correct 74 ms 42732 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 28396 KB Output is correct
2 Correct 161 ms 98668 KB Output is correct
3 Correct 83 ms 48552 KB Output is correct
4 Correct 139 ms 93164 KB Output is correct