CSES - HIIT Open 2024 - Results
Submission details
Task:Hiitism
Sender:ht
Submission time:2024-11-16 13:14:44 +0200
Language:C++ (C++17)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.01 sdetails
#7ACCEPTED0.01 sdetails
#8ACCEPTED0.03 sdetails
#9ACCEPTED0.03 sdetails
#10ACCEPTED0.03 sdetails
#11ACCEPTED0.03 sdetails
#12ACCEPTED0.02 sdetails
#13ACCEPTED0.01 sdetails
#14ACCEPTED0.01 sdetails
#15ACCEPTED0.01 sdetails
#16ACCEPTED0.02 sdetails
#17ACCEPTED0.02 sdetails
#18ACCEPTED0.01 sdetails
#19ACCEPTED0.01 sdetails
#20ACCEPTED0.02 sdetails
#21ACCEPTED0.01 sdetails
#22ACCEPTED0.01 sdetails
#23ACCEPTED0.01 sdetails
#24ACCEPTED0.01 sdetails
#25ACCEPTED0.01 sdetails
#26ACCEPTED0.01 sdetails
#27ACCEPTED0.01 sdetails
#28ACCEPTED0.01 sdetails
#29ACCEPTED0.01 sdetails
#30ACCEPTED0.01 sdetails

Code

#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define all(x) x.begin(), x.end()
#define rep(i,a,b) for(int i=a; i<=b; i++)
template<typename T> ostream& operator<<(ostream& os, const vector<T> v){ for(const auto& x : v){ os << x << " ";} return os; }
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>> y){
for(const auto& v : y){
for(const auto& x : v) {os << x << " ";} cout << "\n";} return os;
}
int findrow(vector<vector<char>>& s, ll n, ll m){
for(int i=0; i<n; i++){
char c = s[i][0];
if(c == '.')
continue;
bool x = true;
for(int j=1; j<m; j++){
if(s[i][j] != c){
x = false;
break;
}
}
if(x){
return i;
}
}
return -1;
}
int findcol(vector<vector<char>>& s, ll n, ll m){
for(int i=0; i<m; i++){
char c = s[0][i];
if(c == '.')
continue;
bool x = true;
for(int j=1; j<n; j++){
if(s[j][i] != c){
x = false;
break;
}
}
if(x){
return i;
}
}
return -1;
}
int main(){
ios::sync_with_stdio(0);
vector<vector<char>> s;
ll n0,m0;
cin >> n0 >> m0;
ll n = n0, m = m0;
string _; getline(cin, _, '\n');
for(int i=0; i<n0; i++){
string s2;
getline(cin, s2, '\n');
vector<char> row;
for(int j=0; j<m0; j++){
row.push_back(s2[j]);
}
s.push_back(row);
}
vector<int> ridxs;
vector<int> cidxs;
for(int i=0; i<n0; i++){
ridxs.push_back(i+1);
}
for(int i=0; i<m0; i++){
cidxs.push_back(i+1);
}
vector<string> res;
while(n>0 && m>0){
// cout << s << "\n";
int c = findrow(s, n, m);
if(c != -1){
// cout << "row: " << c << "\n";
string r;
r += "R "; r += to_string(ridxs[c]); r += " "; r += s[c][0];;
res.push_back(r);
s.erase(s.begin()+c);
n --;
ridxs.erase(ridxs.begin()+c);
continue;
}
c = findcol(s, n, m);
if(c != -1){
// cout << "col: " << c << "\n";
string r;
r += "C "; r += to_string(cidxs[c]); r += " "; r += s[0][c];
res.push_back(r);
for(int i=0; i<n; i++){
s[i].erase(s[i].begin()+c);
}
m --;
cidxs.erase(cidxs.begin()+c);
continue;
}
break;
}
// cout << "end:\n" << s << "\n";
for(const auto& v : s){
for(const auto& x : v){
if(x != '.'){
cout << "Impossible\n";
return 0;
}
}
}
cout << res.size() << "\n";
res = vector(res.rbegin(), res.rend());
for(const auto& r : res)
cout << r << "\n";
}

Test details

Test 1

Verdict: ACCEPTED

input
3 3
.H.
IHI
TTT

correct output
3
R 2 I
C 2 H
R 3 T

user output
3
R 2 I
C 2 H
R 3 T

Test 2

Verdict: ACCEPTED

input
2 2
.H
IH

correct output
2
R 2 I
C 2 H

user output
2
R 2 I
C 2 H

Test 3

Verdict: ACCEPTED

input
10 10
T.TIH.....
IIIIIIIIII
T.TIH.....
TIIIHIIIII
...

correct output
7
C 3 T
R 10 I
R 4 I
C 5 H
...

user output
7
C 3 T
R 10 I
R 4 I
C 5 H
...

Test 4

Verdict: ACCEPTED

input
100 100
.............H........I.....IT...

correct output
19
R 3 T
C 44 H
R 34 I
C 30 T
...

user output
19
R 3 T
C 44 H
R 34 I
C 30 T
...

Test 5

Verdict: ACCEPTED

input
100 100
.........................H.......

correct output
Impossible

user output
Impossible

Test 6

Verdict: ACCEPTED

input
1000 1000
H.II..T.I.IH..I..H.I..I..ITHH....

correct output
Impossible

user output
Impossible

Test 7

Verdict: ACCEPTED

input
1000 1000
HHHIHHHHHHHHHHHHIHHHHHHHHHHHHH...

correct output
Impossible

user output
Impossible

Test 8

Verdict: ACCEPTED

input
1000 1000
IHIHTI.T.H..IHHIIT.I.TT.HH.HI....

correct output
1552
C 822 I
C 83 T
C 55 I
R 984 H
...

user output
1552
C 886 H
C 822 I
C 83 T
C 55 I
...

Test 9

Verdict: ACCEPTED

input
1000 1000
HHHHHHHHHHHHHHHHHHHHHIHHHHHHHH...

correct output
1727
R 500 I
C 938 H
C 804 H
R 263 H
...

user output
1727
R 500 I
C 938 H
R 263 H
C 888 I
...

Test 10

Verdict: ACCEPTED

input
1000 1000
TITTTHTITTHTHTHITTTTTTTHTHTTTI...

correct output
1856
C 22 H
R 531 T
C 412 H
C 288 H
...

user output
1856
C 22 H
R 531 T
C 412 H
C 288 H
...

Test 11

Verdict: ACCEPTED

input
1000 1000
IHHTTTTHTIIIHTTTTHTIITTTHHITIT...

correct output
1826
R 200 H
R 167 I
C 445 I
C 355 I
...

user output
1826
R 200 H
C 445 I
C 355 I
C 303 I
...

Test 12

Verdict: ACCEPTED

input
1000 1000
TTTTTITTTHTHTITIIHTIITIHTTIHTT...

correct output
Impossible

user output
Impossible

Test 13

Verdict: ACCEPTED

input
1000 1000
TITHITITIITTIIIIIHIIIIHTIIIHTI...

correct output
Impossible

user output
Impossible

Test 14

Verdict: ACCEPTED

input
1000 1000
TTTTTTTTTTTTTTTTTTTITTTTTTTITT...

correct output
Impossible

user output
Impossible

Test 15

Verdict: ACCEPTED

input
1000 1000
IHTHHHIHIIIHHTTHHHHIHIIHHIHHHH...

correct output
Impossible

user output
Impossible

Test 16

Verdict: ACCEPTED

input
1000 500
HIHHTHTITTHIHTHTTHIHTTIHTTHHTH...

correct output
1417
C 75 I
R 430 T
C 195 H
R 441 I
...

user output
1417
C 75 I
R 430 T
C 201 I
C 195 H
...

Test 17

Verdict: ACCEPTED

input
500 1000
IHIIIHIIHIIIIIHIHHIIIIIIIIIIII...

correct output
1418
C 971 T
C 744 I
C 654 I
C 540 T
...

user output
1418
C 971 T
C 744 I
C 654 I
C 540 T
...

Test 18

Verdict: ACCEPTED

input
1000 500
IIIIIIIIIIIIIIITIIIIIIITTIIIII...

correct output
Impossible

user output
Impossible

Test 19

Verdict: ACCEPTED

input
500 1000
HIITITHHHHIHHIHHTHIIIHHHHTHTHH...

correct output
Impossible

user output
Impossible

Test 20

Verdict: ACCEPTED

input
1000 1000
TIITIIIIIIIIIIIIIIIIIHIHIIIIII...

correct output
Impossible

user output
Impossible

Test 21

Verdict: ACCEPTED

input
1000 1000
TTHTTTTTHTTTHTTTTTTTTHHTTTTTIT...

correct output
Impossible

user output
Impossible

Test 22

Verdict: ACCEPTED

input
1000 1000
IHIIIIITHIIIHIHHHITHIIIIHTTIHI...

correct output
Impossible

user output
Impossible

Test 23

Verdict: ACCEPTED

input
1000 1000
TTHIHIITHTI.HHIHHITIHIHIHIITIH...

correct output
Impossible

user output
Impossible

Test 24

Verdict: ACCEPTED

input
1000 1000
IHIHIIIIIIIIIHIIIHIHIITIHIIIII...

correct output
Impossible

user output
Impossible

Test 25

Verdict: ACCEPTED

input
1000 500
HIHITTIHITHHHTITHIHHHTHHIHHIII...

correct output
Impossible

user output
Impossible

Test 26

Verdict: ACCEPTED

input
500 1000
HHHHHHHHHHHHHHHHHHHHHHHHHHHHHH...

correct output
Impossible

user output
Impossible

Test 27

Verdict: ACCEPTED

input
1000 500
TTTTIHTTTHTTHTITTTTHTHTTHTITTI...

correct output
Impossible

user output
Impossible

Test 28

Verdict: ACCEPTED

input
500 1000
HTIIIHIIIHITIHIIIIIIHTIIIIITHI...

correct output
Impossible

user output
Impossible

Test 29

Verdict: ACCEPTED

input
1000 1000
.................................

correct output
0

user output
0

Test 30

Verdict: ACCEPTED

input
1000 1000
.................................

correct output
1
C 562 T

user output
1
C 562 T