oj.uz

답안 #486374

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
486374 2021-11-11T13:12:32 Z PoPularPlusPlus Type Printer (IOI08_printer) C++17
10 / 100
 29 ms 2364 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

bool check(string& a , string& b){
	for(int i = 0; i < (int)a.size(); i++){
		if(a[i]!=b[i])return 1;
	}
	return 0;
}

bool cmp(string a , string b){
	return a.size() < b.size();
}

void solve(){
	int n;
	cin >> n;
	string arr[n];
	for(int i = 0; i < n; i++)cin >> arr[i];
	sort(arr,arr + n , cmp);
	/*int mn = 1e9 , pos = -1;
	for(int i = 0; i < n-1 ;i++){
		if(arr[i][0] != arr[i + 1][0]){
			if(mn > (int)arr[i].size()){
				mn = arr[i].size();
				pos = i;
			}
		}
	}
	if(mn > (int)arr[n-1].size()){
		mn = arr[n-1].size();
		pos = n-1;
	}
	int j = pos;
	while(j >= 0 && arr[j][0] == arr[pos][0]){
		j--;
	}
	string a[n];
	int cur = 0;
	for(int i = j + 1; i < n; i++){
		a[cur++] = arr[i];
	}
	for(int i = 0; i <= j; i++){
		a[cur++] = arr[i];
	}
	for(int i = 0; i < n; i++)arr[i] = a[i];*/
	vector<char> v;
	string s = "";
	for(int i = 0; i < n; i++){
		while(check(s,arr[i])){
			v.pb('-');
			s.pop_back();
		}
		for(int j = s.size(); j < (int)arr[i].size(); j++){
			s += arr[i][j];
			v.pb(arr[i][j]);
		}
		v.pb('P');
	}
	cout << v.size() << '\n';
	for(char c : v)cout << c << '\n';
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 1256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 29 ms 2364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 2364 KB Output isn't correct
2 Halted 0 ms 0 KB -