-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathChallenges in school №41
More file actions
76 lines (74 loc) · 2.28 KB
/
Challenges in school №41
File metadata and controls
76 lines (74 loc) · 2.28 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
import java.util.*;
import java.io.*;
import java.awt.*;
import java.util.List;
public class Main {
public static void main(String[] args) throws Exception {
FastReader sc = new FastReader();
StringBuilder sb=new StringBuilder();
int n=sc.nextInt(),k=sc.nextInt(),count=0;
char[] c=sc.next().toCharArray();
LinkedList<LinkedList<Integer>> ll=new LinkedList<>();
LinkedList<Integer> temp;
for(int i=0;i<n;i++){
temp=new LinkedList<>();
boolean flag=false;
for(int j=0;j<n-1;j++){
if(c[j]=='R' && c[j+1]=='L'){
temp.add(j+1);
c[j]='L';
c[j+1]='R';
count++;
j++;
flag=true;
}
}
if(!flag)break;
else ll.add(temp);
}
if(count<k || ll.size()>k) System.out.println(-1);
else{
int[] z;
int rem=k-ll.size();
for(LinkedList<Integer> x:ll){
int p=Math.max(x.size()-rem,1);
rem-=(x.size()-p);
sb.append(p+" ");
z=new int[x.size()];
int i=0;
for(int j:x)z[i++]=j;
for(int j=0;j<p;j++)sb.append(z[j]+" ");
sb.append("\n");
for(int j=p;j<x.size();j++)sb.append(1+" "+z[j]+"\n");
}
System.out.println(sb);
}
}
}
class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() { br = new BufferedReader(new InputStreamReader(System.in)); }
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() { return Integer.parseInt(next()); }
long nextLong() { return Long.parseLong(next()); }
double nextDouble() { return Double.parseDouble(next()); }
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}