50095. Lines of Words
難度:4.5/51
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
77
78#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int n;
char ipt[1050624];
char arr[10000000];
char* arr_ptr;
int t;
int word_cnt[1024];
static inline int cnt_words(char* s, int n){
int ans = 1;
for(int i = 0; i < n; i++){
if(s[i] == ' ') ans += 1;
}
return ans;
}
static inline char*** get_ptr(){
char*** first_level = (char***) malloc(sizeof(char**) * n);
arr_ptr = arr;
for(int i = 0; i < n; i++){
fgets(arr_ptr, 1050624, stdin);
int len_s = strlen(arr_ptr);
int cnt = cnt_words(arr_ptr, len_s);
word_cnt[i] = cnt;
char** second_level = (char**) malloc(sizeof(char*) * cnt);
first_level[i] = second_level;
int _cnt = 0;
char* token = strtok(arr_ptr, " \n");
while(token != NULL){
second_level[_cnt++] = token;
token = strtok(NULL, " \n");
}
arr_ptr += len_s;
}
return first_level;
}
static inline void solve(char*** ptr){
int l1, w1, l2, w2;
scanf("%d %d %d %d", &l1, &w1, &l2, &w2);
char* temp = ptr[l1][w1];
ptr[l1][w1] = ptr[l2][w2];
ptr[l2][w2] = temp;
}
static inline void print_word(char* p){
while(*p != '\0') putchar(*p), p++;
}
static inline void print(char*** ptr){
for(int i = 0; i < n; i++){
for(int j = 0; j < word_cnt[i]; j++){
print_word(ptr[i][j]);
if(j != word_cnt[i] - 1) putchar(' ');
else putchar('\n');
}
}
}
int main(){
scanf("%d", &n); getchar();
char*** ptr = get_ptr();
// print(ptr);
scanf("%d", &t);
while(t--) solve(ptr);
print(ptr);
}