oj.uz

Submission #705886

# Submission time Handle Problem Language Result Execution time Memory
705886 2023-03-05T15:15:52 Z assem_albitar Type Printer (IOI08_printer) C++14
70 / 100
 147 ms 100696 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mod 1000000007
#define mxe(v)   *max_element(v.begin(), v.end())
#define all(v)   v.begin(), v.end()
#define allr(v) v.rbegin(),v.rend()
#define F first
#define S second
#define pi pair<ll,ll>
#define assem ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
using namespace std;
const int N=400200;
const double PI=3.1415926535897932384626433;
const double eps = 1e-9;
string getString()
{
    char c[(int)21];
    //scanf(" %c",&a[i]);
    scanf("%s", c);
    return c;
    //string x = getString();
}
///printf("%d\n",);
///scanf("%d",&);
///cout.precision(10);
///puts("")string
vector<char> ans;
int n;
vector<string> v;
struct trie
{
    int cnt,c;
    trie* child[26];
    trie()
    {
        cnt=c=0;
        memset(child,0,sizeof child);
    }
    void add(int i,int j)
    {
        if(j==v[i].size())
        {
            c++;
            cnt=j;
            return;
        }
        if(child[v[i][j]-'a']==0)child[v[i][j]-'a']=new trie();
        child[v[i][j]-'a']->add(i,j+1);
        cnt=max(cnt,child[v[i][j]-'a']->cnt);
    }
    void get()
    {
        while(c>0)
        {
            c--;
            ans.push_back('P');
        }
        vector<pair<int,char>> a;
        for(char i='a'; i<='z'; i++)
        {
            if(child[i-'a']!=0)
            {
                a.push_back({child[i-'a']->cnt,i});
            }
        }
        sort(all(a));
        for(int i=0; i<a.size(); i++)
        {
            ans.push_back(a[i].S);
            child[a[i].S-'a']->get();
            ans.push_back('-');
        }
        return;
    }
};
int main()
{
    scanf("%d",&n);
    trie* root=new trie();
    for(int i=0; i<n; i++)
    {
        string q;
        q=getString();
        v.push_back(q);
        root->add(i,0);
    }
    root->get();
    while(ans.back()=='-')ans.pop_back();
    printf("%d\n",(int)ans.size());
    for(int i=0; i<ans.size(); i++)
    {
        printf("%c\n",ans[i]);
    }
}

Compilation message

printer.cpp: In member function 'void trie::add(int, int)':
printer.cpp:44:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |         if(j==v[i].size())
      |            ~^~~~~~~~~~~~~
printer.cpp: In member function 'void trie::get()':
printer.cpp:70:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         for(int i=0; i<a.size(); i++)
      |                      ~^~~~~~~~~
printer.cpp: In function 'int main()':
printer.cpp:93:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |     for(int i=0; i<ans.size(); i++)
      |                  ~^~~~~~~~~~~
printer.cpp: In function 'std::string getString()':
printer.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%s", c);
      |     ~~~~~^~~~~~~~~
printer.cpp: In function 'int main()':
printer.cpp:81:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1748 KB Output is correct
2 Incorrect 3 ms 2260 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5972 KB Output is correct
2 Correct 19 ms 12624 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 15096 KB Output is correct
2 Correct 9 ms 3660 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 37444 KB Output is correct
2 Correct 122 ms 84588 KB Output is correct
3 Correct 72 ms 44528 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 29632 KB Output is correct
2 Correct 147 ms 100696 KB Output is correct
3 Correct 75 ms 50936 KB Output is correct
4 Correct 129 ms 95552 KB Output is correct