oj.uz

Submission #1053451

# Submission time Handle Problem Language Result Execution time Memory
1053451 2024-08-11T12:01:43 Z Malix Type Printer (IOI08_printer) C++14
10 / 100
 19 ms 2256 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
 
ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

int main() {   
// ios::sync_with_stdio(0);
// cin.tie(0);
    int n;cin>>n;
    vector<string> a(n);
    REP(i,0,n)cin>>a[i];
    sort(a.begin(),a.end());
    string s;
    vector<char> ans;
    REP(i,0,n){
        if(s.empty()){
            for(auto u:a[i]){
                ans.PB(u);
                s.PB(u);
            }
            ans.PB('P');
            continue;
        }
        int mn=-1;
        int k=min(s.size(),a[i].size());
        REP(j,0,k){
            if(s[j]!=a[i][j])break;
            mn=j;
        }
        int t=s.size();
        REP(j,mn+1,t){
            ans.PB('-');
            s.pop_back();
        }
        REP(j,mn+1,a[i].size()){
            ans.PB(a[i][j]);
            s.PB(a[i][j]);
        }
        ans.PB('P');
    }
    cout<<ans.size()<<"\n";
    for(auto u:ans)cout<<u<<"\n";
}

Compilation message

printer.cpp: In function 'int main()':
printer.cpp:13:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 | #define REP(i,a,b) for(int i=a;i<b;i++)
......
   53 |         REP(j,mn+1,a[i].size()){
      |             ~~~~~~~~~~~~~~~~~~   
printer.cpp:53:9: note: in expansion of macro 'REP'
   53 |         REP(j,mn+1,a[i].size()){
      |         ^~~

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
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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