solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
char ar[200], er[200];
int main() {
int a = 0, b = 0;
scanf(" %s %s", ar + 1, er + 1);
int uz = strlen(ar + 1);
for (int i = 1; i <= uz; i += 2) {
if (ar[i] == '8' && er[i] == '[') a++;
if (ar[i] == '8' && er[i] == '(') b++;
if (ar[i] == '(' && er[i] == '[') b++;
if (ar[i] == '(' && er[i] == '8') a++;
if (ar[i] == '[' && er[i] == '8') b++;
if (ar[i] == '[' && er[i] == '(') a++;
}
if (a > b)
cout << "TEAM 1 WINS" << endl;
else if (b > a)
cout << "TEAM 2 WINS" << endl;
else
cout << "TIE" << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int sign(char x, char y) {
if (x == y) {
return 0;
}
if (x == '8' && y == '[' || x == '[' && y == '(' || x == '(' && y == '8') {
return 1;
}
return -1;
}
int main() {
string a, b;
cin >> a >> b;
int x = 0, y = 0;
for (int i = 0; i < a.size(); i += 2) {
int p = sign(a[i], b[i]);
if (p == 1) {
x++;
}
if (p == -1) {
y++;
}
}
if (x == y) {
cout << "TIE";
}
if (x > y) {
cout << "TEAM 1 WINS";
} else if (x < y) {
cout << "TEAM 2 WINS";
}
return 0;
}
| 7 | CPP |
in1=input()
in2=input()
def beat(one, two):
if one=='8<' and two=='[]':
return True
elif one=='[]' and two=='()':
return True
elif one=='()' and two=='8<':
return True
elif one!=two:
return False
p1=0
p2=0
length=len(in1)
for x in range(0, length, 2):
if in1[x:x+2]!=in2[x:x+2]:
if beat(in1[x:x+2], in2[x:x+2]):
p1+=1
else:
p2+=1
if p1==p2:
print("TIE")
elif p1<p2:
print("TEAM 2 WINS")
else:
print("TEAM 1 WINS")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int get(char *s) {
if (s[0] == '8' && s[1] == '<') return 1;
if (s[0] == '[' && s[1] == ']') return 2;
if (s[0] == '(' && s[1] == ')') return 3;
}
int check(int a, int b) {
if (a == 1 && b == 2 || a == 2 && b == 3 || a == 3 && b == 1) return 1;
if (a == 2 && b == 1 || a == 3 && b == 2 || a == 1 && b == 3) return 2;
return 0;
}
int main() {
char a[100] = {0}, b[100] = {0};
scanf("%s", a);
scanf("%s", b);
int x = 0, y = 0;
for (int i = 0; i < strlen(a); i += 2) {
int t = check(get(a + i), get(b + i));
if (t == 1) x++;
if (t == 2) y++;
}
if (x == y)
printf("TIE");
else if (x < y)
printf("TEAM 2 WINS");
else
printf("TEAM 1 WINS");
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
char t1[30], t2[30];
int n;
int main() {
scanf("%s", &t1);
scanf("%s", &t2);
for (int i = 0; i <= strlen(t1); i += 2) {
if (t1[i] == '8')
if (t2[i] == '[')
n++;
else if (t2[i] == '(')
n--;
if (t1[i] == '[')
if (t2[i] == '(')
n++;
else if (t2[i] == '8')
n--;
if (t1[i] == '(')
if (t2[i] == '8')
n++;
else if (t2[i] == '[')
n--;
}
if (n > 0)
cout << "TEAM 1 WINS";
else if (n < 0)
cout << "TEAM 2 WINS";
else
cout << "TIE";
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
string a, b;
int cnt1 = 0, cnt2 = 0;
void ReadInput() { cin >> a >> b; }
void Solve() {
for (int i = 0; i < a.size(); i += 2) {
if (a[i] == '[' && a[i + 1] == ']') {
if (b[i] == '(' && b[i + 1] == ')') cnt1++;
if (b[i] == '8' && b[i + 1] == '<') cnt2++;
}
if (a[i] == '(' && a[i + 1] == ')') {
if (b[i] == '[' && b[i + 1] == ']') cnt2++;
if (b[i] == '8' && b[i + 1] == '<') cnt1++;
}
if (a[i] == '8' && a[i + 1] == '<') {
if (b[i] == '(' && b[i + 1] == ')') cnt2++;
if (b[i] == '[' && b[i + 1] == ']') cnt1++;
}
}
if (cnt1 == cnt2)
cout << "TIE";
else if (cnt1 > cnt2)
cout << "TEAM 1 WINS";
else
cout << "TEAM 2 WINS";
}
int main() {
ReadInput();
Solve();
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::string a;
std::getline(cin, a);
;
std::string b;
std::getline(cin, b);
;
int team1 = 0;
int team2 = 0;
for (int i = 0; i < a.size(); i = i + 2) {
if (a[i] == b[i]) {
} else if ((a[i] == '8' && b[i] == '[') || (a[i] == '[' && b[i] == '(') ||
(a[i] == '(' && b[i] == '8')) {
team1++;
} else {
team2++;
}
}
if (team1 == team2) {
cout << "TIE";
} else if (team1 > team2) {
cout << "TEAM 1 WINS";
} else {
cout << "TEAM 2 WINS";
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
int l = a.length();
int x = 0, y = 0;
for (int i = 0; i < l; i += 2) {
if (a[i] == b[i]) continue;
if ((a[i] == '[' && b[i] == '8') || (a[i] == '8' && b[i] == '(') ||
(a[i] == '(' && b[i] == '['))
y++;
else
x++;
}
if (x > y)
cout << "TEAM 1 WINS";
else if (y > x)
cout << "TEAM 2 WINS";
else
cout << "TIE";
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t1 = 0, t2 = 0;
char a[1000], b[1000];
cin >> a >> b;
for (int i = 0; i < strlen(a); i = i + 2) {
if (a[i] != b[i])
if (a[i] == '8') {
if (b[i] == '(') {
t2++;
} else
t1++;
} else if (a[i] == '(') {
if (b[i] == '[') {
t2++;
} else
t1++;
} else if (a[i] == '[') {
if (b[i] == '8') {
t2++;
} else
t1++;
}
}
if (t2 < t1)
cout << "TEAM 1 WINS";
else if (t1 < t2)
cout << "TEAM 2 WINS";
else
cout << "TIE";
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0, i, len;
char a[25], b[25], x, y;
scanf("%s %s", a, b);
len = strlen(a);
for (i = 0; i < len; ++i) {
x = a[i];
y = b[i];
if (x == '8' && y == '[') ans++;
if (x == '8' && y == '(') ans--;
if (x == '[' && y == '8') ans--;
if (x == '[' && y == '(') ans++;
if (x == '(' && y == '[') ans--;
if (x == '(' && y == '8') ans++;
i++;
}
if (ans > 0) {
printf("TEAM 1 WINS");
}
if (ans < 0) {
printf("TEAM 2 WINS");
}
if (ans == 0) {
printf("TIE");
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
int main() {
char a[100], b[100];
int t1, t2;
t1 = t2 = 0;
scanf("%s%s", a, b);
for (int i = 0; i < strlen(a); i += 2) {
if (a[i] == b[i])
continue;
else {
if (a[i] == '8' && b[i] == '[')
t1++;
else if (a[i] == '[' && b[i] == '(')
t1++;
else if (a[i] == '(' && b[i] == '8')
t1++;
else if (a[i] == b[i]) {
t1++;
t2++;
} else
t2++;
}
}
if (t1 == t2)
printf("TIE\n");
else if (t1 > t2)
printf("TEAM 1 WINS\n");
else
printf("TEAM 2 WINS\n");
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int calc(string A, string B) {
if (A == B) return 0;
if (A == "8<" && B == "[]") return 1;
if (A == "[]" && B == "()") return 1;
if (A == "()" && B == "8<") return 1;
return -1;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string teamA, teamB;
int scoreA;
cin >> teamA >> teamB;
scoreA = 0;
for (int i = 0; i < teamA.size(); i += 2) {
string moveA = teamA.substr(i, 2);
string moveB = teamB.substr(i, 2);
scoreA += calc(moveA, moveB);
}
if (!scoreA)
cout << "TIE" << endl;
else if (scoreA < 0)
cout << "TEAM 2 WINS" << endl;
else
cout << "TEAM 1 WINS" << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
bool Finish_read;
template <class T>
inline void read(T &x) {
Finish_read = 0;
x = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
if (ch == EOF) return;
ch = getchar();
}
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
x *= f;
Finish_read = 1;
}
template <class T>
inline void print(T x) {
if (x / 10 != 0) print(x / 10);
putchar(x % 10 + '0');
}
template <class T>
inline void writeln(T x) {
if (x < 0) putchar('-');
x = abs(x);
print(x);
putchar('\n');
}
template <class T>
inline void write(T x) {
if (x < 0) putchar('-');
x = abs(x);
print(x);
}
string s, t;
int res1, res2;
int main() {
cin >> s >> t;
int n = s.length();
for (int i = 0; i < n; i += 2) {
if (s[i] == '[' && t[i] == '8') res2++;
if (s[i] == '[' && t[i] == '(') res1++;
if (s[i] == '(' && t[i] == '[') res2++;
if (s[i] == '(' && t[i] == '8') res1++;
if (s[i] == '8' && t[i] == '[') res1++;
if (s[i] == '8' && t[i] == '(') res2++;
}
if (res1 == res2) puts("TIE");
if (res1 < res2) puts("TEAM 2 WINS");
if (res1 > res2) puts("TEAM 1 WINS");
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
string str1, str2;
int cmp(int x) {
if (str1[x] == str2[x]) return 0;
if (str1[x] == '8' && str2[x] == '[') return 1;
if (str1[x] == '[' && str2[x] == '(') return 1;
if (str1[x] == '(' && str2[x] == '8') return 1;
return -1;
}
int main() {
int tmp, l, ans1, ans2, i;
while (cin >> str1 >> str2) {
l = str1.size();
ans1 = 0;
ans2 = 0;
for (i = 0; i < l; i += 2) {
tmp = cmp(i);
if (tmp == 1) {
ans1++;
} else if (tmp == -1) {
ans2++;
}
}
if (ans1 > ans2) {
printf("TEAM 1 WINS\n");
} else if (ans1 < ans2) {
printf("TEAM 2 WINS\n");
} else {
printf("TIE\n");
}
}
return 0;
}
| 7 | CPP |
a = input()
b = input()
D = {
('8<', '8<') : 0,
('[]', '[]') : 0,
('()', '()') : 0,
('8<', '[]') : -1,
('()', '[]') : 1,
('[]', '8<') : 1,
('[]', '()') : -1,
# Guess
('8<', '()') : 1,
('()', '8<') : -1,
}
r = 0
for i in range(0, len(a), 2):
x = a[i:i+2]
y = b[i:i+2]
r += D[x,y]
if r > 0:
print('TEAM 2 WINS')
elif r < 0:
print('TEAM 1 WINS')
else:
print('TIE')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char a[2345][2345];
int d[2345][2345];
int dx[] = {1, 0, 0, -1};
int dy[] = {0, 1, -1, 0};
int main() {
int n, m, i, j, k;
cin >> n >> m >> k;
string s = "ULRD";
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
for (j = 1; j <= m; j++) {
int d = 0;
for (i = 1; i <= n; i++) {
int t = (i - 1);
for (k = 0; k < 4; k++) {
int x = i + dx[k] * t;
int y = j + dy[k] * t;
if (x >= 1 && x <= n && y <= m && y >= 1 && a[x][y] == s[k]) d++;
}
}
cout << d << " ";
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char mapa[2005][2005];
int C[2005];
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
for (int i = 0; i < n; i++) {
cin >> mapa[i];
for (int j = 0; j < m; j++) {
if (mapa[i][j] == '.') continue;
if (mapa[i][j] == 'D') continue;
if (mapa[i][j] == 'U') {
if (i % 2 == 0) C[j]++;
continue;
}
int pos = j;
if (mapa[i][j] == 'R')
pos += i;
else
pos -= i;
if (pos < 0 || pos >= m) continue;
C[pos]++;
}
}
for (int i = 0; i < m; i++) {
if (i) cout << " ";
cout << C[i];
}
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
char a[2005][2005];
int main() {
int n, m, k;
int i, j;
int b[2005] = {0};
scanf("%d%d%d", &n, &m, &k);
for (i = 0; i < n; i++) scanf("%s", a[i]);
for (i = 1; i < n; i++)
for (j = 0; j < m; j++) {
if (a[i][j] == 'R' && i + j < m) b[i + j]++;
if (a[i][j] == 'L' && j - i >= 0) b[j - i]++;
if (a[i][j] == 'U') {
if (i % 2 == 0) b[j]++;
}
}
for (i = 0; i < m; i++) printf("%d ", b[i]);
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char g[2222][2222];
int main() {
ios::sync_with_stdio(false);
int R, C, K;
cin >> R >> C >> K;
for (int r = 0; r < R; r++) cin >> g[r];
for (int c = 0; c < C; c++) {
int res = 0;
for (int r = 0; r < R; r++) {
if (c - r >= 0 && g[r][c - r] == 'R') res++;
if (c + r < C && g[r][c + r] == 'L') res++;
if (r + r < R && g[r + r][c] == 'U') res++;
}
cout << res << ' ';
}
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char p[2014][2014];
int ans[2014];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m, k, i, j;
scanf("%d%d%d", &n, &m, &k);
for (i = 0; i < n; ++i) scanf("%s", p[i]);
for (i = 0; i < n; ++i) {
for (j = 0; j < m; ++j) {
switch (p[i][j]) {
case 'L':
if (j - i >= 0) ++ans[j - i];
break;
case 'R':
if (j + i < m) ++ans[j + i];
break;
case 'D':
break;
case 'U':
if (((i + 1) & 1) == 1) ++ans[j];
break;
default:
break;
}
}
}
printf("%d", ans[0]);
for (j = 1; j < m; ++j) printf(" %d", ans[j]);
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1000 * 1000 * 1000;
const int nmax = 5000;
string s;
int n, m, k, ans[nmax];
int main() {
cin >> n >> m >> k;
getline(cin, s);
getline(cin, s);
for (int i = 1; i < n; i++) {
getline(cin, s);
for (int j = 0; j < m; j++) {
if (s[j] == 'R') {
if (i + j < m) ans[i + j]++;
} else if (s[j] == 'L') {
if (j - i >= 0) ans[j - i]++;
} else if (s[j] == 'U') {
if (i % 2 == 0) ans[j]++;
}
}
}
for (int i = 0; i < m; i++) cout << ans[i] << " ";
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
const T& max(const T& a, const T& b, const T& c) {
return max(a, max(b, c));
}
template <class T>
const T& min(const T& a, const T& b, const T& c) {
return min(a, min(b, c));
}
long long stoi(string& str) {
istringstream second(str);
long long i;
second >> i;
return i;
}
string itos(long long i) {
stringstream second;
second << i;
return second.str();
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long poww(long long a, long long b) {
long long res = 1;
for (int i = 1; i <= b; i++) res *= a;
return res;
}
long long sumOfDigs(string s) {
long long sum = 0;
for (int i = 0; i < s.length(); i++) sum += s[i] - '0';
return sum;
}
long long mod = 1000000 + 3;
int program();
using namespace std;
int cnt[2001];
char a[2001][2001];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) cin >> a[i][j];
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= m; j++) {
char c = a[i][j];
if (c == 'L' && (j - i + 1 >= 1))
cnt[j - i + 1]++;
else if (c == 'R' && j + i - 1 <= m)
cnt[j + i - 1]++;
else if (c == 'U' && (i & 1))
cnt[j]++;
}
}
for (int i = 1; i <= m; i++) cout << cnt[i] << " ";
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
struct Spider {
char d;
int i, j;
Spider(char dd, int ii, int jj) {
d = dd;
i = ii;
j = jj;
}
};
int main() {
int n, m, k;
std::cin >> n >> m >> k;
std::vector<Spider> spiders;
std::vector<int> answers(m, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
char c;
std::cin >> c;
if (c == '.' || c == 'D')
continue;
else if (c == 'U' && i % 2 == 0)
answers[j]++;
else if (c == 'R' || c == 'L') {
int ind = (c == 'L') ? j - i : j + i;
if (ind < m && ind >= 0) answers[ind]++;
}
}
}
for_each(answers.begin(), answers.end(),
[](const int &a) { std::cout << a << " "; });
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
const long double pie = 3.1415926535;
using namespace std;
long long fpow(long long n, long long p) {
long long m = 1;
while (p) {
if (p % 2) m *= n;
p >>= 1;
n *= n;
}
return m;
}
bool br1, br2, br;
char ch, ch1, ch2;
long long n, k, x, y, z, mini, maxi, l, ind, ini, sum, t, len, r, w, imini, m;
string s, s1, s2;
long long a[(int)1e5 + 10];
void solve() {
cin >> n >> m >> k;
for (long long i = 0; i < n; i++)
for (long long j = 0; j < m; j++) {
cin >> ch;
if (ch == 'U' && i % 2 == 0) a[j]++;
if (ch == 'L' && j >= i) a[j - i]++;
if (ch == 'R' && j + i < m) a[i + j]++;
}
for (long long i = 0; i < m; i++) cout << a[i] << " ";
cout << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<vector<int>> mass(n, vector<int>(m, 0));
string s;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < m; j++) {
if (s[j] == 'R') {
if (j + i < m) {
mass[i][j + i]++;
}
}
if (s[j] == 'L') {
if (j - i >= 0) {
mass[i][j - i]++;
}
}
if (s[j] == 'U') {
if (i % 2 == 0) {
mass[i / 2][j]++;
}
}
}
}
for (int i = 0; i < m; i++) {
int ans = 0;
for (int j = 0; j < n; j++) {
ans += mass[j][i];
}
cout << ans << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char board[2020][2020];
int main() {
int n, m, k;
while (scanf("%d%d%d", &n, &m, &k) == 3) {
for (int i = 0; i < n; i++) {
scanf("%s", board[i]);
}
for (int j = 0; j < m; j++) {
if (j > 0) {
printf(" ");
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (2 * i < n && board[2 * i][j] == 'U') {
cnt++;
}
if (board[0][j] == 'D') {
cnt++;
}
if (j - i >= 0 && board[i][j - i] == 'R') {
cnt++;
}
if (j + i < m && board[i][j + i] == 'L') {
cnt++;
}
}
printf("%d", cnt);
}
printf("\n");
}
return 0;
}
| 8 | CPP |
#!/usr/bin/python
import re
import inspect
from sys import argv, exit
def rstr():
return input()
def rint():
return int(input())
def rints(splitchar=' '):
return [int(i) for i in input().split(splitchar)]
def varnames(obj, namespace=globals()):
return [name for name in namespace if namespace[name] is obj]
def pvar(var, override=False):
prnt(varnames(var), var)
def prnt(*args, override=False):
if '-v' in argv or override:
print(*args)
class Spider():
def __init__(self, x, y, d):
self.x = x
self.y = y
self.d = d
def get_copy(self):
return Spider(self.x, self.y, self.d)
def move(self):
if self.d == 'R':
self.x += 1
elif self.d == 'L':
self.x -= 1
elif self.d == 'U':
self.y -= 1
elif self.d == 'D':
self.y += 1
else:
raise Exception('WHAT HAVE YOU DONE', self.d)
def main(i, n, m, lders, rders, uders):
sightings = 0
iders = [s for s in uders if s.x == i and s.y % 2 == 0]
sightings += len(iders)
prnt('id', len(iders))
ulders = [s for s in rders if s.y == (i - s.x)]
sightings += len(ulders)
prnt('uld', len(ulders))
urders = [s for s in lders if s.y == (s.x - i)]
sightings += len(urders)
prnt('urd', len(urders))
return str(sightings)
if __name__ == '__main__':
(n,m,k) = rints()
field = [rstr() for i in range(n)]
si = [0 for i in range(m)]
spiders = []
for j,row in enumerate(field):
for i,space in enumerate(row):
if space == 'R':
if i+j < len(si):
si[i+j] += 1
if space == 'L':
if i-j >= 0:
si[i-j] += 1
if space == 'U':
if j % 2 == 0:
si[i] += 1
print(' '.join([str(i) for i in si]))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int dp[2005][2005];
int main() {
int i, j;
int n, m, k;
char temp;
cin >> n >> m >> k;
char arr[n + 1][m + 1];
for (i = 1; i < n + 1; i++) {
for (j = 1; j < m + 1; j++) {
cin >> temp;
arr[i][j] = temp;
}
}
int ind = 0;
for (int i = 2; i <= n; i++) {
ind++;
for (int j = 1; j <= m; j++) {
if (j - ind >= 1) {
if (arr[i][j - ind] == 'R') dp[i][j]++;
}
if (j + ind <= m) {
if (arr[i][j + ind] == 'L') dp[i][j]++;
}
if (i - ind >= 1) {
if (arr[i - ind][j] == 'D') dp[i][j]++;
}
if (i + ind <= n) {
if (arr[i + ind][j] == 'U') dp[i][j]++;
}
}
}
for (int i = 1; i <= m; i++) {
int ans = 0;
for (int j = 2; j <= n; j++) {
ans = ans + dp[j][i];
}
cout << ans << " ";
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, ans[2005];
char a[2010][2010];
void load() {
scanf("%d%d%d\n", &n, &m, &k);
for (int i = 0; i < n; i++) {
scanf("%s", a[i]);
}
}
void solve() {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (a[i][j] == 'L') {
if (j - i >= 0) {
ans[j - i]++;
}
}
if (a[i][j] == 'R') {
if (j + i < m) {
ans[j + i]++;
}
}
if (a[i][j] == 'U') {
if (i % 2 == 0) {
ans[j]++;
}
}
}
}
for (int i = 0; i < m; i++) {
if (i > 0) printf(" ");
printf("%d", ans[i]);
}
printf("\n");
}
int main() {
load();
solve();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
int cnt[2000];
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
memset(cnt, 0, sizeof(cnt));
char c;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
scanf(" %c", &c);
if (c == 'U') {
if (i % 2 == 0) cnt[j]++;
} else if (c == 'R') {
if (j + i < m) cnt[j + i]++;
} else if (c == 'L') {
if (j - i >= 0) cnt[j - i]++;
}
}
}
for (int i = 0; i < m; ++i) {
printf("%d", cnt[i]);
if (i < m - 1) printf(" ");
}
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int spiders[2000];
int main() {
cin >> n >> m >> k;
for (int r = 0; r < n; ++r) {
for (int c = 0; c < m; ++c) {
char t;
cin >> t;
if (t == 'U') {
if (r % 2 == 0) {
spiders[c]++;
}
}
if (t == 'R') {
int nc = c + r;
if (nc < 2000) spiders[nc]++;
}
if (t == 'L') {
int nc = c - r;
if (nc >= 0) spiders[nc]++;
}
}
}
for (int i = 0; i < m; ++i) {
cout << spiders[i];
if (i + 1 < m)
cout << ' ';
else
cout << endl;
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char board[2222][2222];
int main(void) {
int n = 0;
int m = 0;
int k = 0;
scanf("%d %d %d", &n, &m, &k);
for (int i = 0; i < n; i++) scanf("%s", board[i]);
for (int c = 0; c < m; c++) {
int spider = 0;
for (int i = 1; i < n; i++) {
spider += (((i + i) >= 0 && (i + i) < n && (c) >= 0 && (c) < m)
? board[i + i][c]
: '.') == 'U';
spider += (((i - i) >= 0 && (i - i) < n && (c) >= 0 && (c) < m)
? board[i - i][c]
: '.') == 'D';
spider += (((i) >= 0 && (i) < n && (c - i) >= 0 && (c - i) < m)
? board[i][c - i]
: '.') == 'R';
spider += (((i) >= 0 && (i) < n && (c + i) >= 0 && (c + i) < m)
? board[i][c + i]
: '.') == 'L';
}
printf("%d%c", spider, c == m - 1 ? '\n' : ' ');
}
while (getchar() != EOF)
;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 1010;
const double eps = 1e-10;
const long long MOD = 1e9 + 7;
char s[2010];
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
int t[2010];
memset(t, 0, sizeof(t));
for (int i = 0; i < (n); ++i) {
scanf("%s", s);
for (int j = 0; j < (m); ++j) {
if (s[j] == 'R' && i + j < m) t[i + j]++;
if (s[j] == 'L' && j - i >= 0) t[j - i]++;
if (s[j] == 'U' && i % 2 == 0) t[j]++;
}
}
for (int i = 0; i < (m - 1); ++i) cout << t[i] << ' ';
cout << t[m - 1] << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int kkaass = 1;
char B[2009][2009];
int n, m;
int main() {
int i, j, k;
while (cin >> n >> m >> k) {
for (i = (1); i <= (n); i++)
for (j = (1); j <= (m); j++) scanf(" %c", &B[i][j]);
int ans[2009] = {0};
for (i = (2); i <= (n); i++) {
for (j = (1); j <= (m); j++) {
if (B[i][j] == 'R') {
int t = i - 1;
if (j + t < 2009) ans[j + t]++;
} else if (B[i][j] == 'L') {
int t = i - 1;
if (j - t >= 0) ans[j - t]++;
} else if (B[i][j] == 'U') {
int t = i;
if (t & 1) ans[j]++;
}
}
}
for (i = (1); i <= (m); i++) {
if (i == 1)
cout << ans[i];
else
cout << " " << ans[i];
}
cout << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T abs(T a) {
return a >= 0 ? a : -a;
}
template <class T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
template <class T>
T mod(T a, T b) {
T ret = a % b;
if (ret < 0) ret += b;
return ret;
}
long long mulmod(long long a, long long b, long long c) {
if (b == 0LL) return 0LL;
long long ret = mulmod(a, b >> 1, c);
ret = (ret + ret) % c;
if (b & 1LL) ret = (ret + a) % c;
return ret;
}
long long powmod(long long a, long long b, long long c) {
if (b == 0LL) return 1LL;
long long ret = powmod(a, b >> 1, c);
ret = ret * ret % c;
if (b & 1LL) ret = ret * a % c;
return ret;
}
template <class T>
inline void wt(T x) {
if (x < 0) putchar('-'), x = -x;
if (x < 10)
putchar(x + '0');
else
wt(x / 10), putchar(x % 10 + '0');
}
template <class T>
inline void rd(T& x) {
bool f = 0;
char ch;
for (ch = getchar(); ch <= 32; ch = getchar())
;
if (ch == '-') f = 1, ch = getchar();
for (x = 0; ch > 32; ch = getchar()) x = (x << 3) + (x << 1) + ch - '0';
if (f) x = -x;
}
const int N = 2005;
int tt;
int u, v, w, n, m, k, ans[N];
string s[N];
int main() {
rd(n), rd(m), rd(k);
for (register int i = 1; i <= n; ++i) cin >> s[i - 1];
for (register int i = 0; i <= n - 1; ++i)
for (register int j = 0; j < int(s[i].size()); ++j) {
char c = s[i][j];
if (c == 'U') {
if (i % 2 == 0) ans[j]++;
} else if (c == 'R') {
u = i + j;
if (u < m) ans[u]++;
} else if (c == 'L') {
u = j - i;
if (u >= 0) ans[u]++;
}
}
for (register int i = 1; i <= m; ++i) wt(ans[i - 1]), putchar(' ');
puts("");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, c, t, cur, k;
int ans[2002];
string s;
int main() {
ios::sync_with_stdio(0);
cin >> n >> m >> k;
cin >> s;
for (int i = 0; i < m; i++) ans[i] = 0;
for (int i = 1; i < n; i++) {
cin >> s;
for (int j = 0; j < m; j++) {
if (s[j] == 'R')
if (i + j < m) ans[i + j]++;
if (s[j] == 'L')
if (j - i >= 0) ans[j - i]++;
if (s[j] == 'U')
if (i % 2 == 0) ans[j]++;
}
}
for (int i = 0; i < m; i++) cout << ans[i] << ' ';
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int col[3000];
int main() {
scanf("%d%d%d", &n, &m, &k);
for (int y = 0; y < n; ++y)
for (int x = 0; x < m; ++x) {
char c;
scanf(" %c", &c);
if (c == 'U') col[x] += !(y % 2);
if (c == 'R' and x + y < m) col[x + y]++;
if (c == 'L' and x - y >= 0) col[x - y]++;
}
for (int i = 0; i < m; ++i) printf("%d ", col[i]);
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
int ans[2001];
char s[2222];
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= n; i++) {
scanf("%s", s + 1);
for (int j = 1; s[j]; j++) {
if (s[j] == 'U' && i % 2)
ans[j]++;
else if (s[j] == 'R' && j + i - 1 <= m)
ans[j + i - 1]++;
else if (s[j] == 'L' && j - i + 1 >= 1)
ans[j - i + 1]++;
}
}
for (int i = 1; i <= m; i++) printf("%d ", ans[i]);
puts("");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2010;
const int INF = (int)1e9;
char ch[N][N];
int n, m, k;
int CountSpider(int x, int y, int time) {
int ans = 0;
if (x - time >= 1 && ch[y][x - time] == 'R') ans++;
if (x + time <= m && ch[y][x + time] == 'L') ans++;
if (y - time >= 1 && ch[y - time][x] == 'D') ans++;
if (y + time <= n && ch[y + time][x] == 'U') ans++;
return ans;
}
int main() {
scanf("%d%d%d\n", &n, &m, &k);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) scanf("%c", &ch[i][j]);
scanf("\n");
}
for (int j = 1; j <= m; ++j) {
int time = 0;
int ans = 0;
for (int i = 1; i <= n; ++i) {
ans += CountSpider(j, i, time);
time++;
}
printf("%d ", ans);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int const N = 2020;
char mp[N][N];
int ans[N];
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < (n); ++i) scanf(" %s", mp[i]);
for (int i = 0; i < (n); ++i)
for (int j = 0; j < (m); ++j)
if (mp[i][j] != '.') {
if (mp[i][j] == 'R') {
int tx = j + i;
if (tx < m) ++ans[tx];
} else if (mp[i][j] == 'L') {
int tx = j - i;
if (tx >= 0) ++ans[tx];
} else if (mp[i][j] == 'U') {
if (i % 2 == 0) ++ans[j];
}
}
for (int i = 0; i < (m); ++i) {
if (i == m - 1)
printf("%d\n", ans[i]);
else
printf("%d ", ans[i]);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 6000;
int ans[N];
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
char z;
for (int y = 0; y < n; y++) {
string row;
cin >> row;
for (int x = 0; x < m; x++) {
z = row[x];
if (z == 'U') {
if (y % 2 == 0) {
ans[x]++;
}
}
if (z == 'R' && x + y < m) {
ans[x + y]++;
}
if (z == 'L' && x - y >= 0) {
ans[x - y]++;
}
}
}
for (int i = 0; i < m; i++) {
cout << ans[i] << " ";
}
getchar();
getchar();
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
char v[2009][2009];
int main() {
cin >> n >> m >> k;
for (int i = 0; i < n; i++)
for (int h = 0; h < m; h++) cin >> v[i][h];
for (int i = 0; i < m; i++) {
int ans = 0;
for (int h = 1; h < n; h++) {
if (i - h >= 0 && v[h][i - h] == 'R') ans++;
if (i + h < m && v[h][i + h] == 'L') ans++;
if (h * 2 < n && v[h + h][i] == 'U') ans++;
}
cout << ans << " ";
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int filas, columnas, n;
char c;
cin >> filas >> columnas >> n;
long long movimientos[columnas + 1];
for (int i = 1; i <= columnas; i++) movimientos[i] = 0;
int newPos = 0;
for (int i = 1; i <= filas; i++) {
for (int j = 1; j <= columnas; j++) {
cin >> c;
if (c != '.') {
if (c == 'R') {
newPos = j + (i - 1);
if (newPos <= columnas) movimientos[newPos]++;
} else if (c == 'L') {
newPos = j - (i - 1);
if (newPos <= columnas && newPos >= 0) movimientos[newPos]++;
} else if (c == 'U' && i % 2 != 0) {
movimientos[j]++;
}
}
}
}
for (int i = 1; i <= columnas; i++) {
cout << movimientos[i] << " ";
}
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2005;
char p[maxn][maxn];
int n, m;
inline bool check(int x, int y, char c) {
if (x < 0 || y < 0 || x >= n || y >= m) return 0;
return p[x][y] == c;
}
int main() {
scanf("%d%d%*d", &n, &m);
for (int i = 0; i < n; i++) scanf("%s", p[i]);
for (int j = 0; j < m; j++) {
int curans = 0;
for (int i = 0; i < n; i++) {
curans += check(i, j - i, 'R');
curans += check(i, j + i, 'L');
curans += check(2 * i, j, 'U');
}
cout << curans << ' ';
}
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
int cnt[2005][2005];
int ans[2005];
int n, m, k;
char map[2005][2005];
int d_y[4] = {0, 1, 0, -1}, d_x[4] = {1, 0, -1, 0};
int get_direction(char d) {
if (d == 'R') return 0;
if (d == 'D') return 1;
if (d == 'L') return 2;
return 3;
}
void process() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (map[i][j] != '.') {
int di = get_direction(map[i][j]);
if (di == 0 || di == 2) {
int x = j + d_x[di] * (i - 1);
if (x > 0 && x <= m) cnt[i][x]++;
} else if (di == 3) {
if (i & 1) cnt[i / 2 + 1][j]++;
}
}
}
}
for (int j = 1; j <= m; j++) {
for (int i = 1; i <= n; i++) ans[j] += cnt[i][j];
}
for (int j = 1; j <= m; j++) printf("%d ", ans[j]);
}
int main() {
scanf("%d %d %d", &n, &m, &k);
for (int i = 1; i <= n; i++) scanf(" %s", map[i] + 1);
process();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char a[2000][2000];
int main() {
int n, m, k, i, j, cnt;
vector<int> v;
cin >> n >> m >> k;
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < m; i++) {
cnt = 0;
for (j = 0; j < n; j++) {
if (i - j >= 0 && a[j][i - j] == 'R') cnt++;
if (i + j < m && a[j][i + j] == 'L') cnt++;
if (a[j][i] == 'U' && j % 2 == 0) cnt++;
if (a[0][0] == 'D') cnt++;
}
v.push_back(cnt);
}
for (i = 0; i < v.size(); i++) cout << v[i] << " ";
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, d[2010];
char s[2010][2010];
int main() {
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < n; i++) scanf("%s", s[i]);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (j + i < m && s[i][j + i] == 'L') ++d[j];
if (j - i >= 0 && s[i][j - i] == 'R') ++d[j];
if (i + i < n && s[i + i][j] == 'U') ++d[j];
}
}
for (int i = 0; i < m; i++) printf("%d ", d[i]);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
int main() {
int N, M, K;
while (scanf("%d%d%d", &N, &M, &K) != -1) {
int res[2000] = {};
char buf[2005];
for (int i = 0; i < N; i++) {
scanf(" %s", buf);
for (int j = 0; j < M; j++) {
char c = buf[j];
if (c == 'R') {
int pos = i + j;
if (pos < M) res[pos]++;
}
if (c == 'L') {
int pos = j - i;
if (pos >= 0) res[pos]++;
}
if (c == 'U') {
if (!(i & 1)) res[j]++;
}
}
}
for (int i = 0; i < M; i++) printf("%d ", res[i]);
puts("");
}
}
| 8 | CPP |
#include <bits/stdc++.h>
int spider[4000000];
int ans[20000];
char map[20000];
int main() {
memset(ans, 0, sizeof(0));
int n, m, i, j;
int k;
scanf("%d%d%d", &n, &m, &k);
for (i = 1; i <= n; i++) {
scanf("%s", map);
for (j = 0; map[j] != '\0'; j++) {
if (map[j] == 'L')
if (j - i + 2 >= 1) ans[j - i + 2]++;
if (map[j] == 'R')
if (j + i <= m) ans[j + i]++;
if (map[j] == 'U')
if (i % 2 != 0) ans[j + 1]++;
}
}
for (i = 1; i < m; i++) printf("%d ", ans[i]);
printf("%d\n", ans[m]);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, cnt;
cin >> n >> m >> k;
char park[n][m];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) cin >> park[i][j];
for (int j = 0; j < m; j++) {
cnt = 0;
for (int i = 0; i < n; i++) {
if (j + i < m && park[i][j + i] == 'L') cnt++;
if (j - i >= 0 && park[i][j - i] == 'R') cnt++;
if (park[i][j] == 'U') cnt += !(i & 1);
}
cout << cnt << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
void RD(int &x) { scanf("%d", &x); }
void RD(unsigned int &x) { scanf("%u", &x); }
void RD(double &x) { scanf("%lf", &x); }
void RD(int &x, int &y) { scanf("%d%d", &x, &y); }
void RD(unsigned int &x, unsigned int &y) { scanf("%u%u", &x, &y); }
void RD(double &x, double &y) { scanf("%lf%lf", &x, &y); }
void RD(int &x, int &y, int &z) { scanf("%d%d%d", &x, &y, &z); }
void RD(unsigned int &x, unsigned int &y, unsigned int &z) {
scanf("%u%u%u", &x, &y, &z);
}
void RD(double &x, double &y, double &z) { scanf("%lf%lf%lf", &x, &y, &z); }
void RD(char &x) { x = getchar(); }
void RD(char *s) { scanf("%s", s); }
void RD(string &s) { cin >> s; }
void PR(int x) { printf("%d\n", x); }
void PR(int x, int y) { printf("%d %d\n", x, y); }
void PR(unsigned int x) { printf("%u\n", x); }
void PR(unsigned long long x) { cout << x << endl; }
void PR(double x) { printf("%.4lf\n", x); }
void PR(char x) { printf("%c\n", x); }
void PR(char *x) { printf("%s\n", x); }
void PR(string x) { cout << x << endl; }
void upMin(int &x, int y) {
if (x > y) x = y;
}
void upMin(long long &x, long long y) {
if (x > y) x = y;
}
void upMin(double &x, double y) {
if (x > y) x = y;
}
void upMax(int &x, int y) {
if (x < y) x = y;
}
void upMax(long long &x, long long y) {
if (x < y) x = y;
}
void upMax(double &x, double y) {
if (x < y) x = y;
}
int sgn(double x) {
if (x > 1e-10) return 1;
if (x < -1e-10) return -1;
return 0;
}
long long Gcd(long long x, long long y) {
if (x < 0) x = -x;
if (y < 0) y = -y;
if (y == 0) return x;
return Gcd(y, x % y);
}
long long Lcm(long long x, long long y) { return x / Gcd(x, y) * y; }
long long eular(long long n) {
long long ans = n, i;
for (i = 2; i * i <= n; i++)
if (n % i == 0) {
ans -= ans / i;
while (n % i == 0) n /= i;
}
if (n > 1) ans -= ans / n;
return ans;
}
long long exGcd(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long temp = exGcd(b, a % b, x, y);
long long t = x;
x = y;
y = t - a / b * y;
return temp;
}
long long gcdReverse(long long a, long long b) {
long long x, y;
exGcd(a, b, x, y);
x %= b;
if (x < 0) x += b;
return x;
}
long long myPow(long long a, long long b) {
long long ans = 1;
while (b) {
if (b & 1) ans = ans * a;
a = a * a;
b >>= 1;
}
return ans;
}
long long myPow(long long a, long long b, long long mod) {
a %= mod;
long long ans = 1;
while (b) {
if (b & 1) ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
long long getInt() {
long long x = 0, flag = 1;
char c = getchar();
while (!isdigit(c) && c != '-') c = getchar();
if (c == '-') {
flag = -1, c = getchar();
while (!isdigit(c)) c = getchar();
}
while (isdigit(c)) {
x = x * 10 + c - '0';
c = getchar();
}
return x * flag;
}
long long getSqrt(long long t) {
long long p = sqrt(1.0 * t);
while (p * p > t) p--;
while ((p + 1) <= t / (p + 1)) p++;
return p;
}
struct point {
double x, y;
point() {}
point(double _x, double _y) {
x = _x;
y = _y;
}
void get() { scanf("%lf%lf", &x, &y); }
point operator+(point a) { return point(x + a.x, y + a.y); }
point operator-(point a) { return point(x - a.x, y - a.y); }
point operator*(double t) { return point(x * t, y * t); }
double operator*(point a) { return x * a.y - y * a.x; }
double operator^(point a) { return x * a.x + y * a.y; }
double Len() { return sqrt(x * x + y * y); }
point adjustTo(double L) {
L /= Len();
return point(x * L, y * L);
}
point operator/(double t) { return point(x / t, y / t); }
double rotateAngle(point a) {
point p = *this;
return atan2(p * a, p ^ a);
}
int operator==(point a) { return sgn(x - a.x) == 0 && sgn(y - a.y) == 0; }
void print() { printf("%.4lf %.4lf\n", x, y); }
};
double calPloyArea(point a[], int n) {
double ans = 0;
int i;
for (i = 0; i < n; i++) ans += a[i] * a[(i + 1) % n];
return ans;
}
int changeToClockwise(point a[], int n) {
double s = calPloyArea(a, n);
if (sgn(s) >= 0) return 0;
int L = 0, R = n - 1;
while (L < R) swap(a[L++], a[R--]);
return 1;
}
int pointOnSeg(point p, point a, point b) {
if (sgn((p - a) * (p - b))) return 0;
int x = sgn((p.x - a.x) * (p.x - b.x));
int y = sgn((p.y - a.y) * (p.y - b.y));
return x <= 0 && y <= 0;
}
int pointOnRightOfLine(point p, point a, point b) {
return sgn((p - a) * (b - a)) > 0;
}
int pointOnLine(point p, point a, point b) {
return sgn((p - a) * (b - a)) == 0;
}
int pointOnLeftOfLine(point p, point a, point b) {
return sgn((b - a) * (p - a)) > 0;
}
int getRelationOfPointAndPloy(point a[], int n, point p) {
a[n] = a[0];
int i;
double sum = 0;
for (i = 0; i < n; i++) {
if (pointOnSeg(p, a[i], a[i + 1])) return 0;
point aa = a[i] - p;
point bb = a[i + 1] - p;
sum += aa.rotateAngle(bb);
}
if (fabs(sum - 2 * acos(-1.0)) < 1e-2) return -1;
return 1;
}
int isParal(point a, point b, point p, point q) {
double aa = (b.x - a.x) * (p.y - q.y);
double bb = (b.y - a.y) * (p.x - q.x);
return sgn(aa - bb) == 0;
}
int lineCrossLine(point a, point b, point p, point q, point &ans) {
if (isParal(a, b, p, q)) {
if (!pointOnLine(p, a, b)) return 0;
return 2;
}
double s1 = (p - a) * (q - a);
double s2 = (q - b) * (p - b);
ans = (a * s2 + b * s1) / (s1 + s2);
return 1;
}
int segCrossSeg(point a, point b, point p, point q, point &ans) {
if (isParal(a, b, p, q)) {
if (!pointOnLine(p, a, b)) return 0;
if (sgn(a.x - b.x) == 0) {
if (p.y > q.y) swap(p, q);
if (a.y > b.y) swap(a, b);
if (sgn(q.y - a.y) == -1 || sgn(b.y - p.y) == -1) return 0;
if (q == a || p == b) {
if (q == a) ans = q;
if (p == b) ans = p;
return 1;
}
return 2;
}
if (p.x > q.x) swap(p, q);
if (a.x > b.x) swap(a, b);
if (sgn(q.x - a.x) == -1 || sgn(b.x - p.x) == -1) return 0;
if (q == a || p == b) {
if (q == a) ans = q;
if (p == b) ans = p;
return 1;
}
return 2;
}
lineCrossLine(a, b, p, q, ans);
if (pointOnSeg(ans, a, b) && pointOnSeg(ans, p, q)) return 1;
return 0;
}
const long long MM = 1000000000000LL;
struct BigInteger {
long long a[20];
int cnt;
BigInteger() {
cnt = 1;
a[1] = 0;
}
BigInteger(long long x) {
if (x == 0) {
cnt = 1;
a[1] = 0;
return;
}
cnt = 1;
a[1] = x;
}
void reset() {
cnt = 1;
a[1] = 0;
}
BigInteger operator*(int x) {
if (x == 0) return BigInteger(0);
if (zero()) return BigInteger(0);
BigInteger p = *this;
int i;
for (i = 1; i <= p.cnt; i++) p.a[i] *= x;
int t = 0;
for (i = 1; i <= p.cnt; i++) {
p.a[i] += t;
t = p.a[i] / MM;
p.a[i] %= MM;
}
if (t == 0) return p;
while (t) p.a[++p.cnt] = t % MM, t /= MM;
return p;
}
int zero() { return cnt == 1 && a[1] == 0; }
BigInteger operator+(BigInteger a) {
if (a.zero()) return *this;
if (zero()) return a;
BigInteger p, q;
if (a.cnt > cnt)
p = a, q = *this;
else
p = *this, q = a;
int i;
for (i = 1; i <= q.cnt; i++) p.a[i] += q.a[i];
int re = 0;
for (i = 1; i <= p.cnt; i++) {
p.a[i] += re;
re = p.a[i] / MM;
p.a[i] %= MM;
}
if (re) {
p.a[++p.cnt] = re;
}
return p;
}
};
const long long inf = (((long long)1) << 61) + 5;
const double dinf = 1000000000;
const int INF = 1000000005;
const int N = 222225;
struct SegTree {
struct node {
int L, R, size;
double v;
};
node a[N << 2];
int n;
SegTree() {}
SegTree(int x) {
n = x;
build(1, 1, n);
}
void build(int t, int L, int R) {
a[t].L = L;
a[t].R = R;
if (L == R) {
a[t].size = 0;
a[t].v = 0;
return;
}
int M = (L + R) >> 1;
build(t << 1, L, M);
build(t << 1 | 1, M + 1, R);
a[t].size = a[t << 1].size + a[t << 1 | 1].size;
}
int query(int t, double v) {
if (a[t].L == a[t].R) return a[t].v > v;
if (sgn(a[t << 1].v - v) <= 0) return query(t << 1 | 1, v);
return a[t << 1 | 1].size + query(t << 1, v);
}
void change(int t, int pos, double v) {
if (a[t].L == a[t].R) {
a[t].size = 1;
a[t].v = v;
return;
}
int M = (a[t].L + a[t].R) >> 1;
if (pos <= M)
change(t << 1, pos, v);
else
change(t << 1 | 1, pos, v);
a[t].v =
((a[t << 1].v) > (a[t << 1 | 1].v) ? (a[t << 1].v) : (a[t << 1 | 1].v));
a[t << 1 | 1].size = query(t << 1 | 1, a[t << 1].v);
a[t].size = a[t << 1].size + a[t << 1 | 1].size;
}
};
struct heapTree {
struct heapNode {
int L, R, pri, size;
long long x, y;
heapNode() {}
heapNode(long long _x, long long _y) {
x = _x;
y = _y;
if (x < 0) x = -x, y = -y;
long long tmp = Gcd(x, y);
x /= tmp;
y /= tmp;
}
int operator>=(const heapNode &a) const { return *this == a || *this > a; }
int operator<=(const heapNode &a) const { return *this < a || *this == a; }
int operator==(const heapNode &a) const { return y * a.x == x * a.y; }
int operator<(const heapNode &a) const { return y * a.x < x * a.y; }
int operator>(const heapNode &a) const { return y * a.x > x * a.y; }
};
heapNode a[200005];
int e, root;
void init() {
e = 0;
root = -1;
}
void pushUp(int x) {
if (x == -1) return;
a[x].size = 1;
if (a[x].L != -1) a[x].size += a[a[x].L].size;
if (a[x].R != -1) a[x].size += a[a[x].R].size;
}
void rotL(int &x) {
int y = a[x].R;
a[x].R = a[y].L;
pushUp(x);
a[y].L = x;
pushUp(y);
x = y;
}
void rotR(int &x) {
int y = a[x].L;
a[x].L = a[y].R;
pushUp(x);
a[y].R = x;
pushUp(y);
x = y;
}
void insert(int &k, heapNode p) {
if (k == -1) {
k = ++e;
a[k].L = a[k].R = -1;
a[k].x = p.x;
a[k].y = p.y;
a[k].pri = rand();
} else if (p < a[k]) {
insert(a[k].L, p);
if (a[a[k].L].pri > a[k].pri) rotR(k);
} else {
insert(a[k].R, p);
if (a[a[k].R].pri > a[k].pri) rotL(k);
}
pushUp(k);
}
void insert(long long x, long long y) { insert(root, heapNode(x, y)); }
void del(int &k, heapNode p) {
if (k == -1)
return;
else if (p < a[k])
del(a[k].L, p);
else if (p > a[k])
del(a[k].R, p);
else {
if (a[k].L == -1 && a[k].R == -1)
k = -1;
else if (a[k].L == -1)
k = a[k].R;
else if (a[k].R == -1)
k = a[k].L;
else {
if (a[a[k].L].pri < a[a[k].R].pri) {
rotL(k);
del(a[k].L, p);
} else {
rotR(k);
del(a[k].R, p);
}
}
}
pushUp(k);
}
void del(long long x, long long y) { del(root, heapNode(x, y)); }
int findSmallThan(int k, heapNode p) {
if (k == -1) return 0;
if (p <= a[k]) return findSmallThan(a[k].L, p);
int ans = 1;
if (a[k].L != -1) ans += a[a[k].L].size;
return ans + findSmallThan(a[k].R, p);
}
int findSmallThan(long long x) { return findSmallThan(root, heapNode(1, x)); }
int findBigThan(int k, heapNode p) {
if (k == -1) return 0;
if (p >= a[k]) return findBigThan(a[k].R, p);
int ans = 1;
if (a[k].R != -1) ans += a[a[k].R].size;
return ans + findBigThan(a[k].L, p);
}
int findBigThan(long long x) { return findBigThan(root, heapNode(1, x)); }
};
const int spfaEdgeNum = 5005;
const int spfaNodeNum = 2005;
struct spfaStruct {
struct node {
int v, w;
};
vector<node> g[N];
long long dis[N];
int inq[N], n;
void init(int N) {
n = N;
int i;
for (i = 0; i <= n; i++) g[i].clear(), d[i] = 0;
}
void add(int u, int v, int w = 1) {
node p;
p.v = v;
p.w = w;
g[u].push_back(p);
d[v]++;
}
void spfa(int s) {
int i;
for (i = 1; i <= n; i++) dis[i] = inf, inq[i] = 0;
dis[s] = 0;
inq[s] = 1;
queue<int> Q;
Q.push(s);
while (!Q.empty()) {
int u = Q.front();
Q.pop();
inq[u] = 0;
for (i = 0; i < g[u].size(); i++) {
int v = g[u][i].v;
int w = g[u][i].w;
if (dis[v] > dis[u] + w) {
dis[v] = dis[u] + w;
if (!inq[v]) Q.push(v), inq[v] = 1;
}
}
}
}
long long f[N];
int d[N];
void DP() {
int i;
queue<int> Q;
for (i = 1; i <= n; i++)
if (!d[i]) Q.push(i);
while (!Q.empty()) {
int u = Q.front();
Q.pop();
for (i = 0; i < g[u].size(); i++) {
int v = g[u][i].v;
f[v] += f[u];
if (--d[v] == 0) Q.push(v);
}
}
}
};
struct fraction {
long long a, b;
fraction() {}
fraction(long long x) {
a = x;
b = 1;
}
fraction(long long x, long long y) {
a = x;
b = y;
deal();
}
void deal() {
if (b < 0) b = -b, a = -a;
long long k = Gcd(a, b);
if (k < 0) k = -k;
a /= k;
b /= k;
}
fraction operator+(fraction p) {
fraction ans;
ans.b = Lcm(b, p.b);
ans.a = ans.b / b * a + ans.b / p.b * p.a;
ans.deal();
return ans;
}
fraction operator-(fraction p) {
fraction ans;
ans.b = Lcm(b, p.b);
ans.a = ans.b / b * a - ans.b / p.b * p.a;
ans.deal();
return ans;
}
fraction operator*(fraction p) {
fraction ans;
ans.a = a * p.a;
ans.b = b * p.b;
ans.deal();
return ans;
}
fraction operator/(fraction p) {
fraction ans;
ans.a = a * p.b;
ans.b = b * p.a;
ans.deal();
return ans;
}
int operator<(const fraction &p) const { return a * p.b < b * p.a; }
int operator>(const fraction &p) const { return a * p.b > b * p.a; }
int operator==(const fraction &p) const { return a * p.b == b * p.a; }
int operator!=(const fraction &p) const { return a * p.b != b * p.a; }
};
const int mod = 1000000007;
const long long MAX = 1000000000000000000LL;
const int M = 3005;
int a[M][M];
char s[M][M];
int n, m, K;
int main() {
RD(n, m, K);
int i, j;
for (i = 1; i <= n; i++) RD(s[i] + 1);
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
if (s[i][j] != '.') {
char c = s[i][j];
if (c == 'R') {
int x = j + i - 1;
if (x > m) continue;
a[i][x]++;
} else if (c == 'L') {
int x = j - (i - 1);
if (x >= 1) a[i][x]++;
} else if (c == 'U') {
if (i & 1) a[i / 2 + 1][j]++;
} else if (c == 'D') {
}
}
for (i = n; i >= 1; i--)
for (j = 1; j <= m; j++) {
a[i - 1][j] += a[i][j];
}
for (i = 1; i <= m; i++) {
if (i > 1) putchar(' ');
printf("%d", a[1][i]);
}
puts("");
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int otv[2001];
char ch[2001][2001];
int main() {
int n, m, k;
cin >> n >> m >> k;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> ch[i][j];
}
}
for (int i = 0; i < m; i++) {
for (int I = 1, j = i - 1; j >= 0 && I < n; j--, I++) {
if (ch[I][j] == 'R') otv[i]++;
}
for (int I = 1, j = i + 1; j < m && I < n; j++, I++) {
if (ch[I][j] == 'L') otv[i]++;
}
for (int I = 2, j = i; I < n; I += 2) {
if (ch[I][j] == 'U') otv[i]++;
}
cout << otv[i] << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
char r[2000 + 1];
int v[2000 + 1];
int main(void) {
int n, m, k;
scanf("%d %d %d", &n, &m, &k);
for (int i = 0; i < n; i++) {
scanf("%s", r);
for (int j = 0; j < m; j++)
if (r[j] == 'U' && i % 2 == 0)
v[j]++;
else if (r[j] == 'L' && j >= i)
v[j - i]++;
else if (r[j] == 'R' && j + i < m)
v[j + i]++;
}
for (int j = 0; j < m; j++) printf("%d ", v[j]);
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int a[2001];
char t;
int main() {
scanf("%d%d%d\n", &n, &m, &k);
for (int i = 1; i <= m; i++) a[i] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
scanf("%c", &t);
if ((t == 'U') and (i > 2) and (i % 2 == 1)) a[j]++;
if ((t == 'R') and (i - 1 + j <= m)) a[j + i - 1]++;
if ((t == 'L') and (j - i + 1 > 0)) a[j - i + 1]++;
}
scanf("\n");
}
for (int i = 1; i <= m; i++) printf("%d%c", a[i], ' ');
return 0;
}
| 8 | CPP |
Rows, Columns = 0, 0
Spiders = []
def ReadInput():
global Rows, Columns, Spiders
Rows, Columns, spiderCount = map(int, input().split())
Spiders = [0 for i in range(0, Columns)]
for x in range(0, Rows):
line = input()
for y in range(0, Columns):
if line[y] == 'L':
if y - x >= 0:
Spiders[y - x] += 1
elif line[y] == 'R':
if y + x < Columns:
Spiders[y + x] += 1
elif line[y] == 'U':
if x % 2 == 0:
Spiders[y] += 1
def PrintOutput():
global Rows, Columns, Spiders
for y in range(0, Columns):
print(Spiders[y], end = " ")
print("\n")
def main():
ReadInput()
PrintOutput()
main() | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int q[100000];
int main() {
char ch;
int n, m, i, j, k;
scanf("%d %d %d ", &n, &m, &k);
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
scanf(" %c", &ch);
if (ch == 'R') q[j + (i - 1)]++;
if (ch == 'L')
if (j >= (i - 1)) q[j - (i - 1)]++;
if (ch == 'U' && i % 2) q[j]++;
if (ch == 'D' && i == 1) q[j] += m;
}
}
for (i = 1; i <= m; i++) printf("%d ", q[i]);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
int main() {
static char cc[2000][2000 + 1];
int n, m, k, i, j, cnt;
scanf("%d%d%d", &n, &m, &k);
for (i = 0; i < n; i++) scanf("%s", cc[i]);
for (j = 0; j < m; j++) {
cnt = 0;
for (i = 2; i < n; i += 2)
if (cc[i][j] == 'U') cnt++;
for (i = 1; i < n && j - i >= 0; i++)
if (cc[i][j - i] == 'R') cnt++;
for (i = 1; i < n && j + i < m; i++)
if (cc[i][j + i] == 'L') cnt++;
printf("%d ", cnt);
}
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char mas[2010][2010];
int n, m, k;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
char dir[] = {'L', 'R', 'U', 'D'};
bool norm(int x, int y) { return x >= 0 && y >= 0 && x < n && y < m; }
int main() {
ios::sync_with_stdio(0);
cin >> n >> m >> k;
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j) cin >> mas[i][j];
for (int j = 0; j < m; ++j) {
int cnt = 0;
for (int i = 1; i < n; ++i) {
for (int t = 0; t < 4; ++t)
if (norm(i + dx[t] * i, j + dy[t] * i)) {
if (mas[i + dx[t] * i][j + dy[t] * i] == dir[t]) ++cnt;
}
}
cout << cnt << " ";
}
cout << "\n";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string arr[2001];
int main(int argc, char** argv) {
int row, col, n;
long counter = 0;
cin >> row >> col >> n;
for (int i = 0; i < row; i++) cin >> arr[i];
for (int i = 0; i < col; i++) {
counter = 0;
for (int j = 1; j < row; j++) {
if (j % 2 == 0 && arr[j][i] == 'U') counter++;
if (i - j >= 0 && arr[j][i - j] == 'R') counter++;
if (i + j < col && arr[j][i + j] == 'L') counter++;
}
cout << counter << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2010;
int n, m, k;
int co[N];
char s[N];
int main() {
ios::sync_with_stdio(0);
cin >> n >> m >> k;
for (int i = 1; i <= n; ++i) {
cin >> s;
for (int j = 0; j < m; ++j) {
if (s[j] == 'L')
if (j - i + 1 >= 0) co[j - i + 1]++;
if (s[j] == 'R')
if (j + i - 1 < m) co[j + i - 1]++;
if (s[j] == 'U')
if (i % 2 != 0) co[j]++;
}
memset(s, 0, sizeof(s));
}
for (int i = 0; i < m; ++i) cout << co[i] << ' ';
cout << '\n';
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long dx[] = {1, -1, 0, 0};
long long dy[] = {0, 0, 1, -1};
int n, m, k, a, b, c;
string s[2001];
int main() {
cin >> n >> m >> k;
for (int i = 0; i < n; i++) cin >> s[i];
for (int i = 0; i < m; i++) {
c = 0;
for (int j = 1; j < n; j++) {
if (i + j < m && s[j][i + j] == 'L') c++;
if (i - j >= 0 && s[j][i - j] == 'R') c++;
if (j + j < n && s[2 * j][i] == 'U') c++;
}
printf("%d ", c);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char* argv[]) {
int n, m, k;
cin >> n >> m >> k;
vector<string> M(n);
for (auto& x : M) cin >> x;
for (int j = 0; j < m; ++j) {
long long cnt = 0;
for (int i = 2; i < n; i += 2)
if (M[i][j] == 'U') ++cnt;
for (int i = 1; j + i < m && i < n; ++i)
if (M[i][j + i] == 'L') ++cnt;
for (int i = 1; j - i >= 0 && i < n; ++i)
if (M[i][j - i] == 'R') ++cnt;
cout << cnt << " ";
}
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
enum { MAX = 2010 };
int result[MAX];
int main() {
int n, m;
scanf("%d%d%*d", &n, &m);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
char c;
scanf(" %c", &c);
if (c == 'U' && !(i % 2)) result[j]++;
if (c == 'R' && j + i < m) result[j + i]++;
if (c == 'L' && j - i >= 0) result[j - i]++;
}
for (int i = 0; i < m; i++) printf("%d ", result[i]);
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int counter[15000];
char grid[2015][2050];
int main() {
int n, m, t;
scanf("%d %d %d", &n, &m, &t);
for (int i = 0; i < n; i++) {
scanf("%s", &grid[i]);
}
for (int j = 0; j < m; j++) {
for (int i = 1; i < n; i++) {
if (i + i < n && grid[i + i][j] == 'U') counter[j]++;
if (j + i < m && grid[i][j + i] == 'L') counter[j]++;
if (j - i >= 0 && grid[i][j - i] == 'R') counter[j]++;
}
}
for (int i = 0; i < m; i++) printf("%d ", counter[i]);
}
| 8 | CPP |
#include <bits/stdc++.h>
char s[2010];
int a[2010][2010];
int main() {
int n, m, k, i, j;
scanf("%d %d %d", &n, &m, &k);
for (i = 0; i < n; i++) {
scanf("%s", s);
for (j = 0; j < m; j++) {
if (s[j] == 'U')
a[i][j] = 1;
else if (s[j] == 'R')
a[i][j] = 2;
else if (s[j] == 'D')
a[i][j] = 3;
else if (s[j] == 'L')
a[i][j] = 4;
else
a[i][j] = 0;
}
}
for (j = 0; j < m; j++) {
int res = 0;
for (i = 0; i < n; i++) {
int si, sj;
si = i + i;
sj = j;
if (si < n && a[si][sj] == 1) res++;
si = i;
sj = j - i;
if (sj >= 0 && a[si][sj] == 2) res++;
si = 0;
sj = j;
if (a[si][sj] == 3) res++;
si = i;
sj = j + i;
if (sj < m && a[si][sj] == 4) res++;
}
printf("%d ", res);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long Min(long i, long j) { return i < j ? i : j; }
long Max(long i, long j) { return i > j ? i : j; }
string arr[2005];
long cnt[2005];
int main() {
long i, j, k, l, m, n;
while (cin >> n >> m >> k) {
for (i = 1; i <= n; i++) {
cin >> arr[i];
arr[i] = " " + arr[i];
}
memset(cnt, 0, sizeof(cnt));
for (i = 1; i <= m; i++) {
for (j = 2; j <= n; j++) {
if (i - j + 1 > 0 && arr[j][i - j + 1] == 'R') cnt[i]++;
if (i + j - 1 <= m && arr[j][i + j - 1] == 'L') cnt[i]++;
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
if (arr[i][j] == 'U' && i % 2) cnt[j]++;
}
}
for (i = 1; i <= m; i++) cout << cnt[i] << " ";
cout << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char a[2200][2200];
int n, m, sum;
int main() {
int i, j;
while (scanf("%d %d %d", &n, &m, &sum) != EOF) {
for (i = 0; i < n; i++) {
getchar();
scanf("%s", a[i]);
}
int ans;
for (i = 0; i < m; i++) {
ans = 0;
for (j = 1; j < n; j++) {
if (i - j >= 0 && a[j][i - j] == 'R') ans++;
if (i + j < m && a[j][i + j] == 'L') ans++;
if (j + j < n && a[j + j][i] == 'U') ans++;
}
cout << ans;
if (i != m - 1) cout << " ";
}
cout << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void debug(T a, T b) {
;
}
template <class T>
void chmin(T& a, const T& b) {
if (a > b) a = b;
}
template <class T>
void chmax(T& a, const T& b) {
if (a < b) a = b;
}
namespace std {
template <class S, class T>
ostream& operator<<(ostream& out, const pair<S, T>& a) {
out << '(' << a.first << ',' << a.second << ')';
return out;
}
} // namespace std
int n, m, k;
char buf[2005][2005];
int res[2005];
int main() {
cin >> n >> m >> k;
for (int i = 0; i < (n); ++i) scanf("%s", buf[i]);
for (int i = 0; i < (m); ++i) {
int cnt = 0;
for (int j = 1; i - j >= 0 && j < n; ++j)
if (buf[j][i - j] == 'R') ++cnt;
for (int j = 1; i + j < m && j < n; ++j)
if (buf[j][i + j] == 'L') ++cnt;
for (int j = 2; j < n; j += 2)
if (buf[j][i] == 'U') ++cnt;
res[i] = cnt;
}
for (int i = 0; i < (m); ++i) printf("%d%c", res[i], i == m - 1 ? '\n' : ' ');
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<string> a(n);
for (int i = (0); i < (n); ++i) {
cin >> a[i];
}
vector<int> res(m, 0);
for (int i = (0); i < (n); ++i) {
for (int j = (0); j < (m); ++j) {
if (a[i][j] == '.') continue;
if (a[i][j] == 'U') {
if (i % 2 == 0) res[j]++;
}
if (a[i][j] == 'D') continue;
if (a[i][j] == 'L') {
if (j - i >= 0) res[j - i]++;
}
if (a[i][j] == 'R') {
if (j + i < m) res[j + i]++;
}
}
}
for (int i = (0); i < (m); ++i) cout << res[i] << " ";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, ans[2222];
char c[2222][2222];
int main() {
cin >> n >> m >> k;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) cin >> c[i][j];
for (int j = 1; j <= m; j++) {
int cnt = 0;
for (int i = 1; i <= n; i++) {
int cur = i - 1;
if (j + cur <= m && c[i][j + cur] == 'L') cnt++;
if (j - cur >= 1 && c[i][j - cur] == 'R') cnt++;
if (c[i][j] == 'U' && (i - 1) % 2 == 0) cnt++;
}
ans[j] = cnt;
}
for (int i = 1; i <= m; i++) cout << ans[i] << ' ';
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<vector<char>> v;
char a[2001][2001];
int ans[2001];
int main() {
int n, m, k;
cin >> n >> m >> k;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) cin >> a[i][j];
for (int i = 2; i <= n; i++)
for (int j = 1; j <= m; j++) {
if (j + i - 1 <= m && a[i][j + i - 1] == 'L') ans[j]++;
if (j - i + 1 >= 1 && a[i][j - i + 1] == 'R') ans[j]++;
if (i + (i - 1) <= n && a[i + i - 1][j] == 'U') ans[j]++;
}
for (int i = 1; i <= m; i++) cout << ans[i] << " ";
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {2, 1, 1};
int dy[] = {0, -1, 1};
char dc[] = {'U', 'R', 'L'};
char mp[2010][2010];
int main() {
int n, m, o;
scanf("%d%d%d", &n, &m, &o);
for (int i = 0; i < n; i++) {
scanf("%s", mp[i]);
}
for (int z = 0; z < m; z++) {
int cnt = 0;
for (int k = 0; k < 3; k++) {
int x = 0;
int y = z;
while (1) {
x += dx[k];
y += dy[k];
if (!(x >= 0 && x < n && y >= 0 && y < m)) break;
if (mp[x][y] == dc[k]) cnt++;
}
}
if (z == 0)
printf("%d", cnt);
else
printf(" %d", cnt);
}
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, m, c = -1, p, maxx = -2e17, minn = 2e17, ans;
double db, xx, yy;
int x, y, z, l, r;
char a[5000][5000];
string second, t, sr[10001];
int main() {
cin >> n >> m >> x;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
for (int j = 1; j <= m; j++) {
c = 0;
z = 0;
for (int i = 1; i <= n; i++) {
if (a[i + z][j] == 'U' && i + z <= n) c++;
if (a[i - z][j] == 'D' && i - z >= 1) c++;
if (a[i][j + z] == 'L' && j + z <= m) c++;
if (a[i][j - z] == 'R' && j - z >= 1) c++;
z++;
}
cout << c << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans[10000];
int main() {
int n, m, k;
cin >> n >> m >> k;
for (int j = 0; j < n; j++) {
string s;
cin >> s;
for (int i = 0; i < m; i++)
if (s[i] == 'U' && j % 2 == 0)
ans[i]++;
else if (s[i] == 'R' && i + j < m)
ans[i + j]++;
else if (s[i] == 'L' && i - j >= 0)
ans[i - j]++;
}
for (int i = 0; i < m; i++) cout << ans[i] << ' ';
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
char arr[2005][2005];
char c;
int answ[2005];
int main(void) {
cin >> n >> m >> k;
for (int i = (0); i < (n); ++i) {
scanf("%c", &c);
for (int j = (0); j < (m); ++j) {
scanf("%c", arr[i] + j);
}
}
for (int i = (1); i < (n); ++i) {
for (int j = (0); j < (m); ++j) {
if (2 * i < n && arr[2 * i][j] == 'U') ++answ[j];
if (i + j < m && arr[i][j + i] == 'L') ++answ[j];
if (j - i >= 0 && arr[i][j - i] == 'R') ++answ[j];
}
}
for (int i = (0); i < (m); ++i) printf("%d ", answ[i]);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, -1, 1};
int dy[] = {-1, 1, 0, 0};
char a[2005][2005];
int ans[2005];
int b[2005 * 2005][3];
int n, m, k;
int main() {
int i, j, t;
scanf("%d%d%d", &n, &m, &k);
for (i = 0; i < n; ++i) {
scanf("%s", a[i]);
for (j = 0; j < m; ++j) {
t = -1;
if (a[i][j] == 'R')
t = j + i;
else if (a[i][j] == 'L')
t = j - i;
else if (a[i][j] == 'U') {
if (i % 2 == 0)
t = j;
else
t = -1;
}
if (t >= 0 && t < m) ++ans[t];
}
}
for (j = 0; j < m; ++j) printf("%d ", ans[j]);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
using l2 = long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int n, m, k;
cin >> n >> m >> k;
char s[n][m];
vector<int> ans(m, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> s[i][j];
if (s[i][j] == 'L') {
if (j >= i) {
ans[j - i]++;
}
} else if (s[i][j] == 'R') {
if (i + j < m) {
ans[i + j]++;
}
} else if (s[i][j] == 'U') {
if (((i) & (1)) == 0) {
ans[j]++;
}
}
}
}
for (auto i : ans) cout << i << ' ';
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool gmin(T &a, T b) {
if (a > b) return a = b, true;
return false;
}
template <class T>
inline bool gmax(T &a, T b) {
if (a < b) return a = b, true;
return false;
}
template <class T>
T exgcd(T a, T b, T &first, T &second) {
if (!b)
return first = (T)1, second = (T)0, a;
else {
T d = exgcd(b, a % b, second, first);
return second -= a / b * first, d;
}
}
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
const double DINF = 1e10;
const double EPS = 1e-9;
const double PI = 3.14159265358979323846264338327950288;
const double TAU = 2.0 * PI;
inline int sgn(const double &a) { return a > EPS ? 1 : (a < -EPS ? -1 : 0); }
inline int lowbit(int i) { return i & (-i); }
struct Initializer {
Initializer() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
} initializer;
const int MAXN = 2005;
int n, m, k;
int ans[MAXN];
char s[MAXN][MAXN];
int main() {
scanf("%d %d %d", &m, &n, &k);
for (int i = 1; i <= m; i++) scanf("%s", s[i] + 1);
for (int j = 1; j <= n; j++) {
for (int i = 2; i <= m; i++) {
if (2 * i - 1 <= m) ans[j] += (s[2 * i - 1][j] == 'U');
if (j - i + 1 >= 1) ans[j] += (s[i][j - i + 1] == 'R');
if (j + i - 1 <= n) ans[j] += (s[i][j + i - 1] == 'L');
}
}
printf("%d", ans[1]);
for (int i = 2; i <= n; i++) printf(" %d", ans[i]);
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char field[2002][2002];
int main() {
int m, n, k;
cin >> n >> m >> k;
int res[2002] = {0};
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) cin >> field[i][j];
for (int i = 1; i < n; i++)
for (int j = 0; j < m; j++) {
if ((2 * i <= n) && (field[i + i][j] == 'U')) res[j]++;
if ((j >= i) && (field[i][j - i] == 'R')) res[j]++;
if ((i + j <= m) && (field[i][j + i] == 'L')) res[j]++;
}
for (int i = 0; i < m; i++) cout << res[i] << ' ';
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, -1, 1};
int dy[] = {-1, 1, 0, 0};
int ans[2015];
int n, m, k;
char s[2015][2015];
int main() {
cin >> n >> m >> k;
char c[] = "RLDU";
for (int i = 0; i < n; i++) {
scanf("%s", &s[i]);
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
for (int k = 0; k < 4; k++)
if (0 < i + (i - 1) * dx[k] && i + (i - 1) * dx[k] <= n &&
0 < j + (i - 1) * dy[k] && j + (i - 1) * dy[k] <= m)
if (s[i + (i - 1) * dx[k] - 1][j + (i - 1) * dy[k] - 1] == c[k])
ans[j]++;
}
for (int i = 1; i <= m; i++) printf("%i ", ans[i]);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct spLoc {
int c;
int r;
char type;
};
vector<int> soln;
vector<spLoc> spiders;
void getAns2(int n, int m, int k) {
for (int i = 0; i < spiders.size(); i++) {
if (spiders[i].type == 'U') {
if (spiders[i].r % 2 == 0) soln[spiders[i].c]++;
} else if (spiders[i].type == 'L') {
if ((spiders[i].c - spiders[i].r) >= 0)
soln[spiders[i].c - spiders[i].r]++;
} else if (spiders[i].type == 'R') {
if (spiders[i].c + spiders[i].r < m) soln[spiders[i].c + spiders[i].r]++;
}
}
for (int i = 0; i < m; i++) printf("%d ", soln[i]);
}
int main() {
int n, m, k;
scanf("%d", &n);
scanf("%d", &m);
scanf("%d", &k);
soln.resize(m, 0);
char ch;
string st;
for (int i = 0; i < n; i++) {
cin >> st;
for (int j = 0; j < m; j++) {
ch = st[j];
if (ch == 'U') {
spLoc s;
s.c = j;
s.r = i;
s.type = 'U';
spiders.push_back(s);
} else if (ch == 'R') {
spLoc s;
s.c = j;
s.r = i;
s.type = 'R';
spiders.push_back(s);
} else if (ch == 'L') {
spLoc s;
s.c = j;
s.r = i;
s.type = 'L';
spiders.push_back(s);
}
}
}
getAns2(n, m, k);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int abs(int x) {
if (x < 0) return -x;
return x;
}
int addmod(int v1, int v2) {
int v3 = v1 + v2;
if (v3 >= 1000000007) v3 -= 1000000007;
return v3;
}
int val[10004];
string a[2001];
int n, m, k;
int main() {
scanf("%d", &n), scanf("%d", &m), scanf("%d", &k);
for (int i = (0); i < (n); i++) {
cin >> a[i];
}
int t = 0;
for (int i = (0); i < (n); i++) {
t++;
for (int j = (0); j < (m); j++) {
if (t + i < n && a[t + i + 1][j] == 'U') val[j]++;
if (i + 1 < n && j + t < m && a[i + 1][j + t] == 'L') val[j]++;
if (i + 1 < n && j - t >= 0 && a[i + 1][j - t] == 'R') val[j]++;
}
}
for (int i = (0); i < (m); i++) {
cout << (val[i]), cout << (" ");
}
cout << (endl);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct node {
int x, y, z;
};
node a[5000000];
int go[4][2] = {-1, 0, 1, 0, 0, -1, 0, 1}, ans[5000];
int main() {
int n, m, k;
char ch;
int num = 1;
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
scanf(" %c", &ch);
if (ch == 'R') {
a[num].x = j;
a[num].y = i;
a[num].z = 1;
num++;
}
if (ch == 'L') {
a[num].x = j;
a[num].y = i;
a[num].z = 0;
num++;
}
if (ch == 'U') {
a[num].x = j;
a[num].y = i;
a[num].z = 2;
num++;
}
if (ch == 'D') {
a[num].x = j;
a[num].y = i;
a[num].z = 3;
num++;
}
}
}
for (int j = 1; j <= k; j++) {
if (a[j].z == 2) {
if (a[j].y % 2) ans[a[j].x]++;
}
if (a[j].z == 0 || a[j].z == 1) {
int t = a[j].y - 1;
if (a[j].x + 1 * go[a[j].z][0] * t >= 1 &&
a[j].x + 1 * go[a[j].z][0] * t <= m)
ans[a[j].x + 1 * go[a[j].z][0] * t]++;
}
}
for (int i = 1; i <= m; i++) printf("%d ", ans[i]);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int a[2100];
string s;
int main() {
cin >> n >> m >> k;
for (int i = 0; i < n; ++i) {
cin >> s;
for (int j = 0; j < m; ++j) {
if (s[j] == 'U') {
if (i % 2 == 0) {
++a[j];
}
}
if (s[j] == 'L') {
if (j >= i) {
++a[j - i];
}
}
if (s[j] == 'R') {
if (j + i < m) {
++a[i + j];
}
}
}
}
for (int i = 0; i < m; ++i) {
cout << a[i] << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
int n, m, k, *out;
void add(int index) {
if (index < m && index >= 0) out[index]++;
}
int main() {
char c;
scanf("%d %d %d", &n, &m, &k);
out = new int[m];
for (int i = 0; i < m; i++) out[i] = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
scanf(" %c", &c);
switch (c) {
case 'R':
add(j + i);
break;
case 'L':
add(j - i);
break;
case 'U':
if (i % 2 == 0) add(j);
}
}
for (int i = 0; i < m; i++) printf("%d ", out[i]);
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n = 0, m = 0, k;
vector<string> a;
int CountSpiders(int j) {
int sum = 0;
int jR = j, jL = j;
for (int i = 1; i < n; ++i) {
if (!(i % 2) && a[i][j] == 'U') ++sum;
if (jR > 0) {
--jR;
if (a[i][jR] == 'R') ++sum;
}
if (jL < m - 1) {
++jL;
if (a[i][jL] == 'L') ++sum;
}
}
return sum;
}
int main() {
cin >> n >> m >> k;
cin.ignore(100, '\n');
a.resize(n);
for (int i = 0; i < n; ++i) getline(cin, a[i]);
for (int j = 0; j < m; ++j) {
cout << CountSpiders(j) << " ";
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, res[(1 << 11)];
char s[(1 << 11)][(1 << 11)];
int main() {
cin >> n >> m >> k;
for (int i = 0; i < n; i++) scanf("%s", s[i]);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
if (s[i][j] == 'L' && j - i >= 0) res[j - i]++;
if (s[i][j] == 'R' && j + i < m) res[j + i]++;
if (s[i][j] == 'U' && i % 2 == 0) res[j]++;
}
for (int i = 0; i < m - 1; i++) printf("%d ", res[i]);
printf("%d\n", res[m - 1]);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char field[2002][2002];
int comeaross[2002];
int main() {
int row, col, spider;
cin >> row >> col >> spider;
while (getchar() != '\n') continue;
for (int i = 0; i < row; ++i) gets(field[i]);
memset(comeaross, 0, sizeof(comeaross));
for (int i = 0; i < row; ++i) {
for (int j = 0; j < col; ++j) {
switch (field[i][j]) {
case 'U':
if (i % 2 == 0) comeaross[j] += 1;
break;
case 'L':
if (j - i < col && j - i >= 0) comeaross[j - i] += 1;
break;
case 'R':
if (j + i < col && j + i >= 0) comeaross[j + i] += 1;
break;
default:
break;
}
}
}
for (int i = 0; i < col; ++i) {
if (i < col - 1)
printf("%d ", comeaross[i]);
else
printf("%d\n", comeaross[i]);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-9;
int INF = 2000000000;
long long INFF = 8000000000000000000LL;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
inline string IntToString(int a) {
char x[100];
sprintf(x, "%d", a);
string s = x;
return s;
}
inline int StringToInt(string a) {
char x[100];
int res;
strcpy(x, a.c_str());
sscanf(x, "%d", &res);
return res;
}
inline string GetString(void) {
char x[1000005];
scanf("%s", x);
string s = x;
return s;
}
inline string uppercase(string s) {
int n = (int)s.size();
for (int(i) = (0); (i) < (n); ++(i))
if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
return s;
}
inline string lowercase(string s) {
int n = (int)s.size();
for (int(i) = (0); (i) < (n); ++(i))
if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
return s;
}
inline void OPEN(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
int r, c, k;
vector<pair<pair<int, int>, int> > kuman;
string s;
char pos[256];
int risan[2005];
bool valid(int x) { return (1 <= x && x <= c); }
int main() {
pos['U'] = 0;
pos['R'] = 1;
pos['L'] = 2;
pos['D'] = 3;
scanf("%d %d %d", &r, &c, &k);
for (int(i) = (1); (i) <= (r); ++(i)) {
s = GetString();
for (int(j) = (1); (j) <= (c); ++(j))
if (s[j - 1] != '.') {
if (s[j - 1] == 'R') {
if (valid(j + i - 1)) ++risan[j + i - 1];
} else if (s[j - 1] == 'L') {
if (valid(j - i + 1)) ++risan[j - i + 1];
} else if (s[j - 1] == 'U') {
if (i % 2 == 1) ++risan[j];
}
}
}
for (int(i) = (1); (i) <= (c); ++(i)) printf("%d ", risan[i]);
puts("");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2005;
int N, M, K;
int grid[MAXN][MAXN] = {};
int main(void) {
scanf("%d%d%d", &N, &M, &K);
for (int i = (0); i < (N); ++i)
for (int j = (0); j < (M); ++j) {
char c;
scanf(" %c", &c);
if (c == '.') continue;
if (c == 'L') {
if (j >= i) ++grid[i][j - i];
}
if (c == 'R' && i + j < M) ++grid[i][j + i];
if (c == 'U' && i % 2 == 0) ++grid[i / 2][j];
}
for (int j = (0); j < (M); ++j) {
int sum = 0;
for (int i = (0); i < (N); ++i) sum += grid[i][j];
printf("%d%c", sum, " \n"[j == M - 1]);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
int main() {
char a[2001][2001];
int n, m, k, i, j;
scanf("%d%d%d", &n, &m, &k);
for (i = 0; i < n; i++) {
scanf("%s", &a[i]);
}
for (i = 0; i < m; i++) {
int ans = 0;
for (j = 2; j < n; j = j + 2)
if (a[j][i] == 'U') ans += 1;
for (j = 1; j < n; j++) {
if (i - j >= 0) {
if (a[j][i - j] == 'R') ans += 1;
} else
break;
}
for (j = 1; j < n; j++) {
if (i + j < m) {
if (a[j][i + j] == 'L') ans++;
} else
break;
}
printf("%d ", ans);
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
void read(int &x) {
char ch = getchar();
int f = 1;
while ((ch != '-') && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-')
f = -1, x = 0;
else
x = ch - 48;
ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - 48, ch = getchar();
x *= f;
}
void read(long long &x) {
char ch = getchar();
int f = 1;
while ((ch != '-') && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-')
f = -1, x = 0;
else
x = ch - 48;
ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10LL + ch - 48, ch = getchar();
x *= f;
}
void _print(const int &x) {
if (x < 10)
putchar(48 + x);
else
_print(x / 10), _print(x % 10);
}
void _print(const long long &x) {
if (x < 10)
putchar(48 + x);
else
_print(x / 10), _print(x % 10);
}
void print(const int &x) {
if (x < 0)
putchar('-'), _print(-x);
else
_print(x);
}
void print(const long long &x) {
if (x < 0)
putchar('-'), _print(-x);
else
_print(x);
}
void println(const int &x) {
print(x);
putchar('\n');
}
void println(const long long &x) {
print(x);
putchar('\n');
}
char str[2005];
int an[2005] = {0};
int n, m, k;
int main() {
read(n);
read(m);
read(k);
for (int i = (1); i <= (n); i++) {
scanf("%s", str + 1);
for (int j = (1); j <= (m); j++) {
if (str[j] == 'R')
if (1 <= j + i - 1 && j + i - 1 <= m) an[j + i - 1]++;
if (str[j] == 'U')
if (i & 1) an[j]++;
if (str[j] == 'L')
if (j - i + 1 >= 1 && j - i + 1 <= m) an[j + 1 - i]++;
}
}
for (int i = (1); i <= (m); i++) printf("%d ", an[i]);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i;
int j;
int k;
int n;
int m;
int z;
cin >> n >> m >> z;
char a[n][m];
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (i = 0; i < m; i++) {
k = 0;
for (j = 0; j < n; j++) {
if ((2 * j < n) && a[2 * j][i] == 'U') {
k++;
}
if (a[0][i] == 'D') {
k++;
}
if ((i + j < m) && a[j][i + j] == 'L') {
k++;
}
if ((i - j >= 0) && a[j][i - j] == 'R') {
k++;
}
}
cout << k << " ";
}
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long INF = 1000000000;
char a[2000][2000];
signed main() {
long long n, m, k;
cin >> n >> m >> k;
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (long long j = 0; j < m; j++) {
long long ans = 0;
for (long long i = 0; i < n; i++) {
if (j - i >= 0 && a[i][j - i] == 'R') ans++;
if (j + i < m && a[i][j + i] == 'L') ans++;
if (i + i < n && a[i + i][j] == 'U') ans++;
}
cout << ans << " ";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
char a[4020][2010];
long b[2010];
int main() {
int i, j, t, n, m;
long k;
while (scanf("%d%d%ld", &n, &m, &k) != EOF) {
memset(b, 0, sizeof(b));
for (i = 0; i < n; i++) scanf("%s", a[i]);
for (t = 0; t < n; t++) {
for (j = 0; j < m; j++) {
if (a[t + t][j] == 'U' && t + t <= n - 1) b[j]++;
if (a[t][j + t] == 'L' && j + t <= m - 1) b[j]++;
if (a[t][j - t] == 'R' && j - t >= 0) b[j]++;
}
}
printf("%ld", b[0]);
for (j = 1; j < m; j++) printf("% ld", b[j]);
printf("\n");
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
if (n > 1 && n <= 2000 && m > 1 && m <= 2000 && k >= 0 && k <= m * (n - 1)) {
char *park = new char[n * m];
int *ans = new int[m];
for (int i = 0; i < m; i++) {
ans[i] = 0;
}
for (int r = 0; r < n; r++) {
for (int c = 0; c < m; c++) {
cin >> park[r * m + c];
if (park[r * m + c] == 'U' && r % 2 == 0)
ans[c]++;
else if (park[r * m + c] == 'R') {
if ((r + c) < m) ans[r + c]++;
} else if (park[r * m + c] == 'L')
if ((c - r) >= 0) ans[c - r]++;
}
}
for (int i = 0; i < m; i++) {
cout << ans[i] << " ";
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2005;
char mpt[2005][2005];
int dp[maxn][maxn];
int col[maxn];
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= n; i++) scanf("%s", mpt[i] + 1);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (mpt[i][j] == 'L') {
int w = i - 1;
if (j - w >= 1) dp[i][j - w] += 1;
} else if (mpt[i][j] == 'R') {
int w = i - 1;
if (j + w <= m) dp[i][j + w] += 1;
} else if (mpt[i][j] == 'U' && i % 2 == 1) {
col[j] += 1;
} else if (mpt[i][j] == 'D') {
continue;
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
col[j] += dp[i][j];
}
}
for (int i = 1; i <= m; i++) printf("%d ", col[i]);
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int R = 1, L = 3, U = 0, D = 2;
int row[2000];
vector<pair<pair<int, int>, int> > spider;
int n, m, k;
int main() {
cin >> n >> m >> k;
for (int(i) = 0; (i) < (n); (i)++) {
string foo = "";
cin >> foo;
for (int(j) = 0; (j) < (m); (j)++) {
if (foo[j] == '.' || foo[j] == 'D') continue;
if (foo[j] == 'R')
spider.push_back(pair<pair<int, int>, int>(pair<int, int>(i, j), R));
else if (foo[j] == 'L')
spider.push_back(pair<pair<int, int>, int>(pair<int, int>(i, j), L));
else
spider.push_back(pair<pair<int, int>, int>(pair<int, int>(i, j), U));
}
}
for (int(i) = 0; (i) < (spider.size()); (i)++) {
if (spider[i].second == R) {
if (spider[i].first.first + spider[i].first.second < m)
row[spider[i].first.first + spider[i].first.second]++;
} else if (spider[i].second == U) {
if (spider[i].first.first % 2 == 0) row[spider[i].first.second]++;
} else {
if (spider[i].first.second - spider[i].first.first >= 0)
row[spider[i].first.second - spider[i].first.first]++;
}
}
for (int(i) = 0; (i) < (m); (i)++) cout << row[i] << ' ';
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
string dir = "LRUD";
int n, m, k;
int in(int x, int y) {
if (x >= n || y >= m) return 0;
if (x < 0 || y < 0) return 0;
return 1;
}
char s[2005][2005];
int main() {
cin >> n >> m >> k;
for (int i = 0; i < n; i++) {
scanf("%s", s[i]);
}
for (int i = 0; i < m; i++) {
int c = 0;
int t = 1;
if (s[0][i] != '.') c++;
for (int j = 1; j < n; j++) {
for (int d = 0; d < 4; d++) {
int tx = j + dx[d] * j;
int ty = i + dy[d] * j;
if (!in(tx, ty)) continue;
if (dir[d] != s[tx][ty]) {
continue;
}
c++;
}
t++;
}
cout << c << " ";
}
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
class Spider {
public:
int y;
int x;
char dir;
};
int main(int argv, char** argc) {
int n, m, k;
cin >> n >> m >> k;
Spider spiders[k];
int seens[m];
memset(seens, 0, sizeof(int) * m);
int spideri = 0;
for (int i = 0; i < n; i++) {
string stat;
cin >> stat;
for (int i2 = 0; i2 < m; i2++) {
if (stat[i2] != '.') {
spiders[spideri].y = i;
spiders[spideri].x = i2;
spiders[spideri].dir = stat[i2];
spideri++;
}
}
}
for (int i = 0; i < k; i++) {
Spider s = spiders[i];
if (s.dir == 'R') {
int pos = s.x + s.y;
if (pos >= 0 && pos < m) {
seens[pos] += 1;
}
}
if (s.dir == 'L') {
int pos = s.x - s.y;
if (pos >= 0 && pos < m) {
seens[pos] += 1;
}
}
if (s.dir == 'U') {
if (s.y % 2 == 0) {
seens[s.x] += 1;
}
}
if (s.dir == 'D') {
}
}
for (int i = 0; i < m; i++) {
cout << seens[i] << " ";
}
cout << endl;
}
| 8 | CPP |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.