oj.uz

Submission #655015

# Submission time Handle Problem Language Result Execution time Memory
655015 2022-11-02T14:26:40 Z happypotato Type Printer (IOI08_printer) C++17
100 / 100
 65 ms 4684 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define debug(n) cout << "DEBUG1 " << n << "\n";
#define debug2(n, m) cout << "DEBUG2 " << n << ' ' << m << "\n";
#define debug3(n, m, x) cout << "DEBUG3 " << n << ' ' << m << ' ' << x << "\n";
#define debug4(n, m, x, y) cout << "DEBUG3 " << n << ' ' << m << ' ' << x << ' ' << y << "\n";
#define ss_def stringstream ss // stringstream, do ss_def(str), then ss >> n (n is int)
#define upzero(n) rrn < 0) n = 0
#define alive(n) cout << "Alive here: checkpoint " << n << endl
#pragma GCC optimize("Ofast")
using namespace std;
void yes() {
	cout << "YES\n";
	return;
}
void no() {
	cout << "NO\n";
	return;
}
bool cmp1(string &a, string &b) {
	if (a.length() != b.length()) return a.length() < b.length();
	for (int i = 0; i < min(a.length(), b.length()); i++) {
		if (a[i] != b[i]) return a[i] < b[i];
	}
	return false;
}
string last;
bool cmp2(string &a, string &b) {
	int cnt1 = a.length(), cnt2 = b.length();
	for (int i = 0; i < a.length(); i++) {
		if (a[i] != last[i]) {
			cnt1 = i;
			break;
		}
	}
	for (int i = 0; i < b.length(); i++) {
		if (b[i] != last[i]) {
			cnt2 = i;
			break;
		}
	}
	if (cnt1 != cnt2) return cnt1 < cnt2;
	return a < b;
}
vector<char> ans;
vector<string> v;
void solve(int case_no) {
	// implementation
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		string str;
		cin >> str;
		v.push_back(str);
	}
	sort(v.begin(), v.end(), cmp1);
	last = v[v.size() - 1];
	sort(v.begin(), v.end() - 1, cmp2);
	string str = "";
	int strl = 0;
	for (int i = 0; i < n; i++) {
		int vl = v[i].length();
		int ptr = 0;
		while (ptr < min(vl, strl)) {
			if (str[ptr] == v[i][ptr]) ptr++;
			else break;
		}
		while (str.length() > ptr) {
			ans.push_back('-');
			str.erase(strl - 1, 1);
			strl--;
		}
		for (int j = strl; j < vl; j++) {
			ans.push_back(v[i][j]);
			str += v[i][j];
			strl++;
		}
		ans.push_back('P');
	}
	printf("%d\n", ans.size());
	for (char c : ans) printf("%c\n", c);
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    srand(time(NULL));
    int t = 1;
//  cin >> t;
    for (int i = 1;i <= t;i++) solve(i);
}
/*
 
*/

Compilation message

printer.cpp: In function 'bool cmp1(std::string&, std::string&)':
printer.cpp:23:20: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   23 |  for (int i = 0; i < min(a.length(), b.length()); i++) {
      |                  ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
printer.cpp: In function 'bool cmp2(std::string&, std::string&)':
printer.cpp:31:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  for (int i = 0; i < a.length(); i++) {
      |                  ~~^~~~~~~~~~~~
printer.cpp:37:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for (int i = 0; i < b.length(); i++) {
      |                  ~~^~~~~~~~~~~~
printer.cpp: In function 'void solve(int)':
printer.cpp:69:23: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   69 |   while (str.length() > ptr) {
      |          ~~~~~~~~~~~~~^~~~~
printer.cpp:81:11: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wformat=]
   81 |  printf("%d\n", ans.size());
      |          ~^     ~~~~~~~~~~
      |           |             |
      |           int           std::vector<char>::size_type {aka long unsigned int}
      |          %ld

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
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 #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 724 KB Output is correct
2 Correct 11 ms 920 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1264 KB Output is correct
2 Correct 9 ms 888 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2528 KB Output is correct
2 Correct 48 ms 3908 KB Output is correct
3 Correct 36 ms 3292 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 2376 KB Output is correct
2 Correct 65 ms 4684 KB Output is correct
3 Correct 42 ms 3652 KB Output is correct
4 Correct 52 ms 4436 KB Output is correct