oj.uz

답안 #964375

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
964375 2024-04-16T17:59:41 Z anango Type Printer (IOI08_printer) C++17
90 / 100
 1000 ms 7084 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

int pref(string s1, string s2) {
    for (int i=0; i<s1.size(); i++) {
        if (i>=s2.size() || s1[i]!=s2[i]) {
            return i;
        }
    }
    return min(s1.size(), s2.size());
}

signed main() {
    //freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
    int n;
    cin >> n;
    vector<string> v;
    int ma=0;
    int mpos=-1;
    vector<int> answers(n);
    for (int i=0; i<n; i++) {
        string s;
        cin >> s;
        v.push_back(s);
        if (s.size()>ma) {
            ma=s.size();
            mpos=i;
        }
    }
    string mword=v[mpos];
    for (int i=0; i<n; i++) {
        answers[i] = pref(v[i], mword);
    }
    vector<int> w;
    for (int i=0; i<n; i++) {
        w.push_back(i);
    }
    sort(w.begin(), w.end(), [&](const int s1, const int s2) {

        if (answers[s1]!=answers[s2]) {
            return answers[s1]<answers[s2];
        }
        return v[s1]<v[s2];
    });
    vector<string> v2(n);
    for (int i=0; i<n; i++) {
        v2[i] = v[w[i]];
    }
    int tot=0;
    string prints;
    string current;
    for (int i=0; i<n; i++) {
        int t=pref(current,v2[i]);
        while (current.size()>t) {
            prints.append("-");
            current.pop_back();
        }

        prints.append(v2[i].substr(current.size(), v2[i].size()-current.size()));
        current = v2[i];


        prints.append("P");
    }
    cout << prints.size() << endl;
    for (auto i:prints) {
        cout << i << endl;
    }
}

Compilation message

printer.cpp: In function 'long long int pref(std::string, std::string)':
printer.cpp:6:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 |     for (int i=0; i<s1.size(); i++) {
      |                   ~^~~~~~~~~~
printer.cpp:7:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 |         if (i>=s2.size() || s1[i]!=s2[i]) {
      |             ~^~~~~~~~~~~
printer.cpp: In function 'int main()':
printer.cpp:27:21: 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]
   27 |         if (s.size()>ma) {
      |             ~~~~~~~~^~~
printer.cpp:56:30: 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]
   56 |         while (current.size()>t) {
      |                ~~~~~~~~~~~~~~^~
printer.cpp:51:9: warning: unused variable 'tot' [-Wunused-variable]
   51 |     int tot=0;
      |         ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 9 ms 344 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 348 KB Output is correct
2 Correct 21 ms 604 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 920 KB Output is correct
2 Correct 130 ms 1240 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 1776 KB Output is correct
2 Correct 55 ms 1776 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 394 ms 3600 KB Output is correct
2 Correct 881 ms 5876 KB Output is correct
3 Correct 456 ms 5364 KB Output is correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 332 ms 3516 KB Output is correct
2 Execution timed out 1054 ms 7084 KB Time limit exceeded
3 Halted 0 ms 0 KB -