QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#18592 | #2331. Innovative Alignment | DoorKickers | AC ✓ | 3ms | 3704kb | C++20 | 1.1kb | 2022-01-21 01:42:19 | 2022-05-06 01:49:04 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n; cin >> n;
cin.get();
vector<vector<string>> vec(n + 5);
vector<int> mx(105); int lot = 0;
vector<int> beg(105);
for (int i = 1; i <= n; i++) {
// cout << "i = " << i << '\n';
string line;
getline(cin, line);
stringstream ss(line);
string s;
while (ss >> s) {
// cout << "s = " << s << '\n';
vec[i].push_back(s);
mx[vec[i].size()] = max(mx[vec[i].size()], (int)s.size());
}
lot = max(lot, (int)vec[i].size());
}
beg[1] = 1;
for (int i = 2; i <= lot; i++) {
// cout << "mx[" << i << "] = " << mx[i] << '\n';
beg[i] = beg[i - 1] + mx[i - 1] + 1;
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j < vec[i].size(); j++) {
cout << vec[i][j];
if (j + 1 < lot)
for (int k = 1; k <= beg[j + 2] - beg[j + 1] - vec[i][j].size(); k++) cout << ' ';
}
cout << '\n';
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3548kb
input:
2 Hello World UoI IPL
output:
Hello World UoI IPL
result:
ok
Test #2:
score: 0
Accepted
time: 2ms
memory: 3520kb
input:
3 Align my life plz CTCI sucks Welcome to check in
output:
Align my life plz CTCI sucks Welcome to check in
result:
ok
Test #3:
score: 0
Accepted
time: 2ms
memory: 3704kb
input:
1 a
output:
a
result:
ok
Test #4:
score: 0
Accepted
time: 3ms
memory: 3620kb
input:
1 a aa aaa aaaa aaaaa aaaaaa aaaaaaa aaaaaaaa aaaaaaaaa aaaaaaaaaa
output:
a aa aaa aaaa aaaaa aaaaaa aaaaaaa aaaaaaaa aaaaaaaaa aaaaaaaaaa
result:
ok
Test #5:
score: 0
Accepted
time: 3ms
memory: 3596kb
input:
5 G hash ekas kfsdajfk as j kjsfda asd sdaf k a asfd fdsa f ksda asksda sdaf kj sa dsfa assasa fsda sfda as fd fs sa jk fsd werkwe weqop qpp wri wreq wrewrewwe ppwqe rqwe rwe
output:
G hash ekas kfsdajfk as j kjsfda asd sdaf k a asfd fdsa f ksda asksda sdaf kj sa dsfa assasa fsda sfda as fd fs sa jk fsd werkwe weqop qpp wri wreq wrewrewwe ppwqe rqwe rwe
result:
ok
Test #6:
score: 0
Accepted
time: 3ms
memory: 3600kb
input:
7 ksjda wreuiwreur rwe pt REW rqwe JK asdfj ssfda FK FDSMN FDSBBBBB aewr a rew zxcv nrewjh FSDIEWR rb qwer rweqb sadsa rwe j rweq rj q qwre r i p rewq as brtwbre REWIP fdasnFDSEe treui wae qwre rweq sa r rqwe rwe wer wq qq er t y rweqru rweq
output:
ksjda wreuiwreur rwe pt REW rqwe JK asdfj ssfda FK FDSMN FDSBBBBB aewr a rew zxcv nrewjh FSDIEWR rb qwer rweqb sadsa rwe j rweq rj q qwre r i p rewq as brtwbre REWIP fdasnFDSEe treui wae qwre rweq sa ...
result:
ok
Test #7:
score: 0
Accepted
time: 3ms
memory: 3640kb
input:
9 uwrqeiRE qrwu REEIUREW e E ERE Efsdaa ER Lo ipsum dolor sit amet conctetur adipiscing elit Proin elementu entumgd ornare In ultricies sa Morb sit amet tortor diam Quisque filisis e odio In hac habitsse platea dictumst dRQ FK RQW d mi tristie eficitur risus s adsf fsda ADFS FF kgsd relative gsfd fs...
output:
uwrqeiRE qrwu REEIUREW e E ERE Efsdaa ER Lo ipsum dolor sit amet conctetur adipiscing elit Proin elementu entumgd ornare In ultricies sa Morb sit amet tortor diam Quisque filisis e odio In hac ...
result:
ok
Test #8:
score: 0
Accepted
time: 3ms
memory: 3500kb
input:
8 ewr wer j e suada Donec dignissim an sfd sfda a f d e a fe ea sua da onec g nissim n fjeawk ARE AQ REWQ E Q Vest ibulum in arcu vel erat fring illa veh ic b lum i n arcu veWAE GS af
output:
ewr wer j e suada Donec dignissim an sfd sfda a f d e a fe ea sua da onec g nissim n fjeawk ARE AQ REWQ E Q Vest ibulum in arcu vel erat fring illa veh ic b lum i n arcu ...
result:
ok
Test #9:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
4 fa we rwqewrerq fas we a rfdask RE E E fdsa a seawr ER wer ags ER awfas f er q ewq wreq RERW ewq fasER
output:
fa we rwqewrerq fas we a rfdask RE E E fdsa a seawr ER wer ags ER awfas f er q ewq wreq RERW ewq fasER
result:
ok
Test #10:
score: 0
Accepted
time: 3ms
memory: 3624kb
input:
10 aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa ...
output:
aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaa...
result:
ok
Test #11:
score: 0
Accepted
time: 3ms
memory: 3624kb
input:
10 aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaa...
output:
aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaa...
result:
ok
Test #12:
score: 0
Accepted
time: 3ms
memory: 3600kb
input:
10 a aa aaa aaaa aaaaa aaaaaa aaaaaaa aaaaaaaa aaaaaaaaa aaaaaaaaaa aa aaa aaaa aaaaa aaaaaa aaaaaaa aaaaaaaa aaaaaaaaa aaaaaaaaaa a aaa aaaa aaaaa aaaaaa aaaaaaa aaaaaaaa aaaaaaaaa aaaaaaaaaa a aa aaaa aaaaa aaaaaa aaaaaaa aaaaaaaa aaaaaaaaa aaaaaaaaaa a aa aaa aaaaa aaaaaa aaaaaaa aaaaaaaa aaaaaaa...
output:
a aa aaa aaaa aaaaa aaaaaa aaaaaaa aaaaaaaa aaaaaaaaa aaaaaaaaaa aa aaa aaaa aaaaa aaaaaa aaaaaaa aaaaaaaa aaaaaaaaa aaaaaaaaaa a aaa aaaa aaaaa aaaaaa aaaaaaa aaaaaaaa aaaaaaaaa aaaaaaaaaa a...
result:
ok