Dataset Preview
The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
The dataset generation failed because of a cast error
Error code: DatasetGenerationCastError
Exception: DatasetGenerationCastError
Message: An error occurred while generating the dataset
All the data files must have the same columns, but at some point there are 2 new columns ({'Java', 'Cpp'}) and 7 missing columns ({'Kuin', 'Ruby', 'Go', 'C++', 'Python', 'Crystal', 'Rust'}).
This happened while the json dataset builder was generating data using
hf://datasets/puwaer/puwaer_code_translation/kyopro_codes_cpp_java.json (at revision 36699897bb89deae6ba5dff622d167b37730d160)
Please either edit the data files to have matching columns, or separate them into different configurations (see docs at https://hf.co/docs/hub/datasets-manual-configuration#multiple-configurations)
Traceback: Traceback (most recent call last):
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 1871, in _prepare_split_single
writer.write_table(table)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/arrow_writer.py", line 623, in write_table
pa_table = table_cast(pa_table, self._schema)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/table.py", line 2293, in table_cast
return cast_table_to_schema(table, schema)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/table.py", line 2241, in cast_table_to_schema
raise CastError(
datasets.table.CastError: Couldn't cast
id: int64
name: string
Cpp: string
Java: string
-- schema metadata --
pandas: '{"index_columns": [], "column_indexes": [], "columns": [{"name":' + 534
to
{'id': Value(dtype='int64', id=None), 'name': Value(dtype='string', id=None), 'C++': Value(dtype='string', id=None), 'Crystal': Value(dtype='string', id=None), 'Python': Value(dtype='string', id=None), 'Go': Value(dtype='string', id=None), 'Rust': Value(dtype='string', id=None), 'Kuin': Value(dtype='string', id=None), 'Ruby': Value(dtype='string', id=None)}
because column names don't match
During handling of the above exception, another exception occurred:
Traceback (most recent call last):
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 1438, in compute_config_parquet_and_info_response
parquet_operations = convert_to_parquet(builder)
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 1050, in convert_to_parquet
builder.download_and_prepare(
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 925, in download_and_prepare
self._download_and_prepare(
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 1001, in _download_and_prepare
self._prepare_split(split_generator, **prepare_split_kwargs)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 1742, in _prepare_split
for job_id, done, content in self._prepare_split_single(
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 1873, in _prepare_split_single
raise DatasetGenerationCastError.from_cast_error(
datasets.exceptions.DatasetGenerationCastError: An error occurred while generating the dataset
All the data files must have the same columns, but at some point there are 2 new columns ({'Java', 'Cpp'}) and 7 missing columns ({'Kuin', 'Ruby', 'Go', 'C++', 'Python', 'Crystal', 'Rust'}).
This happened while the json dataset builder was generating data using
hf://datasets/puwaer/puwaer_code_translation/kyopro_codes_cpp_java.json (at revision 36699897bb89deae6ba5dff622d167b37730d160)
Please either edit the data files to have matching columns, or separate them into different configurations (see docs at https://hf.co/docs/hub/datasets-manual-configuration#multiple-configurations)Need help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.
id
int64 | name
string | C++
string | Crystal
string | Python
string | Go
string | Rust
string | Kuin
string | Ruby
null |
|---|---|---|---|---|---|---|---|---|
1 | 001 | #include <iostream>
using namespace std;
long long N, K, L;
long long A[1 << 18];
bool solve(long long M) {
long long cnt = 0, pre = 0;
for (int i = 1; i <= N; i++) {
if (A[i] - pre >= M && L - A[i] >= M) {
cnt += 1;
pre = A[i];
}
}
if (cnt >= K) return true;
return false;
}
int main() {
// Step #1. “ü—Í
cin >> N >> L;
cin >> K;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
// Step #2. “š‚¦‚Å“ñ•ª’T�õ�i‚ß‚®‚é�®“ñ•ª’T�õ–@�j
// https://qiita.com/drken/items/97e37dd6143e33a64c8c
long long left = -1;
long long right = L + 1;
while (right - left > 1) {
long long mid = left + (right - left) / 2;
if (solve(mid) == false) right = mid;
else left = mid;
}
cout << left << endl;
return 0;
} | _, l = read_line.split.map(&.to_i)
k = read_line.to_i
a = read_line.split.map(&.to_i) + [l]
puts (1..10**9).bsearch { |len|
last, cnt = 0, 0
a.each do |i|
if i - last >= len
cnt += 1
last = i
end
end
cnt < k + 1
}.not_nil! - 1
| null | null | null | null | null |
2 | 001 | #include <iostream>
using namespace std;
long long N, K, L;
long long A[1 << 18];
bool solve(long long M) {
long long cnt = 0, pre = 0;
for (int i = 1; i <= N; i++) {
if (A[i] - pre >= M && L - A[i] >= M) {
cnt += 1;
pre = A[i];
}
}
if (cnt >= K) return true;
return false;
}
int main() {
// Step #1. “ü—Í
cin >> N >> L;
cin >> K;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
// Step #2. “š‚¦‚Å“ñ•ª’T�õ�i‚ß‚®‚é�®“ñ•ª’T�õ–@�j
// https://qiita.com/drken/items/97e37dd6143e33a64c8c
long long left = -1;
long long right = L + 1;
while (right - left > 1) {
long long mid = left + (right - left) / 2;
if (solve(mid) == false) right = mid;
else left = mid;
}
cout << left << endl;
return 0;
} | null | n, l = map(int,input().split())
k = int(input())
a = list(map(int,input().split()))
a.append(l)
dif = [a[0]] # 切り口の差を計算
for i in range(n):
dif.append(a[i + 1] - a[i])
def is_ok(x):
length = 0
cnt = 0
for i in dif:
length += i
if length >= x:
length = 0
cnt += 1
return cnt # 分割する領域の個数
def meguru_bisect(ng, ok):
while ng - ok > 1:
mid = (ng + ok) // 2
if is_ok(mid) >= k + 1: # まだまだ大きくできる
ok = mid
else:
ng = mid # 小さくしなければいけない
return ok
print(meguru_bisect(l + 1, -1)) | null | null | null | null |
3 | 001 | #include <iostream>
using namespace std;
long long N, K, L;
long long A[1 << 18];
bool solve(long long M) {
long long cnt = 0, pre = 0;
for (int i = 1; i <= N; i++) {
if (A[i] - pre >= M && L - A[i] >= M) {
cnt += 1;
pre = A[i];
}
}
if (cnt >= K) return true;
return false;
}
int main() {
// Step #1. “ü—Í
cin >> N >> L;
cin >> K;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
// Step #2. “š‚¦‚Å“ñ•ª’T�õ�i‚ß‚®‚é�®“ñ•ª’T�õ–@�j
// https://qiita.com/drken/items/97e37dd6143e33a64c8c
long long left = -1;
long long right = L + 1;
while (right - left > 1) {
long long mid = left + (right - left) / 2;
if (solve(mid) == false) right = mid;
else left = mid;
}
cout << left << endl;
return 0;
} | null | null | package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
var sc = bufio.NewScanner(os.Stdin)
func main() {
buf := make([]byte, 1024*1024)
sc.Buffer(buf, bufio.MaxScanTokenSize)
sc.Split(bufio.ScanWords)
n, l := ScanInt(), ScanInt()
k := ScanInt()
a := ScanIntSlice(n)
ok, ng := 0, l
check := func(x int) bool {
preAi := 0
cnt := 0
for i := 0; i < n; i++ {
if a[i]-preAi >= x && l-a[i] >= x {
cnt++
preAi = a[i]
}
}
return cnt >= k
}
for ng-ok > 1 {
c := (ng + ok) / 2
if check(c) {
ok = c
} else {
ng = c
}
}
fmt.Println(ok)
}
func ScanInt() int {
sc.Scan()
i, err := strconv.Atoi(sc.Text())
if err != nil {
panic(err)
}
return i
}
func ScanIntSlice(n int) []int {
s := make([]int, n)
for i := range s {
s[i] = ScanInt()
}
return s
}
| null | null | null |
4 | 001 | #include <iostream>
using namespace std;
long long N, K, L;
long long A[1 << 18];
bool solve(long long M) {
long long cnt = 0, pre = 0;
for (int i = 1; i <= N; i++) {
if (A[i] - pre >= M && L - A[i] >= M) {
cnt += 1;
pre = A[i];
}
}
if (cnt >= K) return true;
return false;
}
int main() {
// Step #1. “ü—Í
cin >> N >> L;
cin >> K;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
// Step #2. “š‚¦‚Å“ñ•ª’T�õ�i‚ß‚®‚é�®“ñ•ª’T�õ–@�j
// https://qiita.com/drken/items/97e37dd6143e33a64c8c
long long left = -1;
long long right = L + 1;
while (right - left > 1) {
long long mid = left + (right - left) / 2;
if (solve(mid) == false) right = mid;
else left = mid;
}
cout << left << endl;
return 0;
} | null | null | null | fn main() {
proconio::input! {
n: isize,
l: isize,
k: isize,
mut a: [isize; n]
}
a.sort();
let mut ok = 0;
let mut ng = l + 1;
while (ng - ok).abs() > 1 {
let mid = (ok + ng) / 2;
if is_ok(&a, l, k, mid) {
ok = mid;
} else {
ng = mid;
}
}
println!("{}", ok);
}
fn is_ok(a: &Vec<isize>, l: isize, k: isize, mid: isize) -> bool {
let mut x = 0;
let mut y = 0;
for i in a {
if i - x >= mid && l - i >= mid {
x = *i;
y += 1;
}
}
y >= k
}
| null | null |
5 | 001 | #include <iostream>
using namespace std;
long long N, K, L;
long long A[1 << 18];
bool solve(long long M) {
long long cnt = 0, pre = 0;
for (int i = 1; i <= N; i++) {
if (A[i] - pre >= M && L - A[i] >= M) {
cnt += 1;
pre = A[i];
}
}
if (cnt >= K) return true;
return false;
}
int main() {
// Step #1. “ü—Í
cin >> N >> L;
cin >> K;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
// Step #2. “š‚¦‚Å“ñ•ª’T�õ�i‚ß‚®‚é�®“ñ•ª’T�õ–@�j
// https://qiita.com/drken/items/97e37dd6143e33a64c8c
long long left = -1;
long long right = L + 1;
while (right - left > 1) {
long long mid = left + (right - left) / 2;
if (solve(mid) == false) right = mid;
else left = mid;
}
cout << left << endl;
return 0;
} | null | null | null | null | func main()
var n: int :: cui@inputInt()
var l: int :: cui@inputInt()
var k: int :: cui@inputInt()
var a: []int :: #[n + 1]int
for i(0, n - 1)
do a[i] :: cui@inputInt()
end for
do a[n] :: l
var ok: int :: 0
var ng: int :: l + 1
while((ok - ng).abs() > 1)
var mid: int :: (ok + ng) / 2
var prev: int :: 0
var cnt: int :: 0
for i(0, n)
if(a[i] - prev >= mid)
do cnt :+ 1
do prev :: a[i]
end if
end for
var isOk: bool :: cnt >= k + 1
if(isOk)
do ok :: mid
else
do ng :: mid
end if
end while
var ans: int :: ok
do cui@print("\{ans}\n")
end func
| null |
6 | 001 | null | _, l = read_line.split.map(&.to_i)
k = read_line.to_i
a = read_line.split.map(&.to_i) + [l]
puts (1..10**9).bsearch { |len|
last, cnt = 0, 0
a.each do |i|
if i - last >= len
cnt += 1
last = i
end
end
cnt < k + 1
}.not_nil! - 1
| n, l = map(int,input().split())
k = int(input())
a = list(map(int,input().split()))
a.append(l)
dif = [a[0]] # 切り口の差を計算
for i in range(n):
dif.append(a[i + 1] - a[i])
def is_ok(x):
length = 0
cnt = 0
for i in dif:
length += i
if length >= x:
length = 0
cnt += 1
return cnt # 分割する領域の個数
def meguru_bisect(ng, ok):
while ng - ok > 1:
mid = (ng + ok) // 2
if is_ok(mid) >= k + 1: # まだまだ大きくできる
ok = mid
else:
ng = mid # 小さくしなければいけない
return ok
print(meguru_bisect(l + 1, -1)) | null | null | null | null |
7 | 001 | null | _, l = read_line.split.map(&.to_i)
k = read_line.to_i
a = read_line.split.map(&.to_i) + [l]
puts (1..10**9).bsearch { |len|
last, cnt = 0, 0
a.each do |i|
if i - last >= len
cnt += 1
last = i
end
end
cnt < k + 1
}.not_nil! - 1
| null | package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
var sc = bufio.NewScanner(os.Stdin)
func main() {
buf := make([]byte, 1024*1024)
sc.Buffer(buf, bufio.MaxScanTokenSize)
sc.Split(bufio.ScanWords)
n, l := ScanInt(), ScanInt()
k := ScanInt()
a := ScanIntSlice(n)
ok, ng := 0, l
check := func(x int) bool {
preAi := 0
cnt := 0
for i := 0; i < n; i++ {
if a[i]-preAi >= x && l-a[i] >= x {
cnt++
preAi = a[i]
}
}
return cnt >= k
}
for ng-ok > 1 {
c := (ng + ok) / 2
if check(c) {
ok = c
} else {
ng = c
}
}
fmt.Println(ok)
}
func ScanInt() int {
sc.Scan()
i, err := strconv.Atoi(sc.Text())
if err != nil {
panic(err)
}
return i
}
func ScanIntSlice(n int) []int {
s := make([]int, n)
for i := range s {
s[i] = ScanInt()
}
return s
}
| null | null | null |
8 | 001 | null | _, l = read_line.split.map(&.to_i)
k = read_line.to_i
a = read_line.split.map(&.to_i) + [l]
puts (1..10**9).bsearch { |len|
last, cnt = 0, 0
a.each do |i|
if i - last >= len
cnt += 1
last = i
end
end
cnt < k + 1
}.not_nil! - 1
| null | null | fn main() {
proconio::input! {
n: isize,
l: isize,
k: isize,
mut a: [isize; n]
}
a.sort();
let mut ok = 0;
let mut ng = l + 1;
while (ng - ok).abs() > 1 {
let mid = (ok + ng) / 2;
if is_ok(&a, l, k, mid) {
ok = mid;
} else {
ng = mid;
}
}
println!("{}", ok);
}
fn is_ok(a: &Vec<isize>, l: isize, k: isize, mid: isize) -> bool {
let mut x = 0;
let mut y = 0;
for i in a {
if i - x >= mid && l - i >= mid {
x = *i;
y += 1;
}
}
y >= k
}
| null | null |
9 | 001 | null | _, l = read_line.split.map(&.to_i)
k = read_line.to_i
a = read_line.split.map(&.to_i) + [l]
puts (1..10**9).bsearch { |len|
last, cnt = 0, 0
a.each do |i|
if i - last >= len
cnt += 1
last = i
end
end
cnt < k + 1
}.not_nil! - 1
| null | null | null | func main()
var n: int :: cui@inputInt()
var l: int :: cui@inputInt()
var k: int :: cui@inputInt()
var a: []int :: #[n + 1]int
for i(0, n - 1)
do a[i] :: cui@inputInt()
end for
do a[n] :: l
var ok: int :: 0
var ng: int :: l + 1
while((ok - ng).abs() > 1)
var mid: int :: (ok + ng) / 2
var prev: int :: 0
var cnt: int :: 0
for i(0, n)
if(a[i] - prev >= mid)
do cnt :+ 1
do prev :: a[i]
end if
end for
var isOk: bool :: cnt >= k + 1
if(isOk)
do ok :: mid
else
do ng :: mid
end if
end while
var ans: int :: ok
do cui@print("\{ans}\n")
end func
| null |
10 | 001 | null | null | n, l = map(int,input().split())
k = int(input())
a = list(map(int,input().split()))
a.append(l)
dif = [a[0]] # 切り口の差を計算
for i in range(n):
dif.append(a[i + 1] - a[i])
def is_ok(x):
length = 0
cnt = 0
for i in dif:
length += i
if length >= x:
length = 0
cnt += 1
return cnt # 分割する領域の個数
def meguru_bisect(ng, ok):
while ng - ok > 1:
mid = (ng + ok) // 2
if is_ok(mid) >= k + 1: # まだまだ大きくできる
ok = mid
else:
ng = mid # 小さくしなければいけない
return ok
print(meguru_bisect(l + 1, -1)) | package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
var sc = bufio.NewScanner(os.Stdin)
func main() {
buf := make([]byte, 1024*1024)
sc.Buffer(buf, bufio.MaxScanTokenSize)
sc.Split(bufio.ScanWords)
n, l := ScanInt(), ScanInt()
k := ScanInt()
a := ScanIntSlice(n)
ok, ng := 0, l
check := func(x int) bool {
preAi := 0
cnt := 0
for i := 0; i < n; i++ {
if a[i]-preAi >= x && l-a[i] >= x {
cnt++
preAi = a[i]
}
}
return cnt >= k
}
for ng-ok > 1 {
c := (ng + ok) / 2
if check(c) {
ok = c
} else {
ng = c
}
}
fmt.Println(ok)
}
func ScanInt() int {
sc.Scan()
i, err := strconv.Atoi(sc.Text())
if err != nil {
panic(err)
}
return i
}
func ScanIntSlice(n int) []int {
s := make([]int, n)
for i := range s {
s[i] = ScanInt()
}
return s
}
| null | null | null |
11 | 001 | null | null | n, l = map(int,input().split())
k = int(input())
a = list(map(int,input().split()))
a.append(l)
dif = [a[0]] # 切り口の差を計算
for i in range(n):
dif.append(a[i + 1] - a[i])
def is_ok(x):
length = 0
cnt = 0
for i in dif:
length += i
if length >= x:
length = 0
cnt += 1
return cnt # 分割する領域の個数
def meguru_bisect(ng, ok):
while ng - ok > 1:
mid = (ng + ok) // 2
if is_ok(mid) >= k + 1: # まだまだ大きくできる
ok = mid
else:
ng = mid # 小さくしなければいけない
return ok
print(meguru_bisect(l + 1, -1)) | null | fn main() {
proconio::input! {
n: isize,
l: isize,
k: isize,
mut a: [isize; n]
}
a.sort();
let mut ok = 0;
let mut ng = l + 1;
while (ng - ok).abs() > 1 {
let mid = (ok + ng) / 2;
if is_ok(&a, l, k, mid) {
ok = mid;
} else {
ng = mid;
}
}
println!("{}", ok);
}
fn is_ok(a: &Vec<isize>, l: isize, k: isize, mid: isize) -> bool {
let mut x = 0;
let mut y = 0;
for i in a {
if i - x >= mid && l - i >= mid {
x = *i;
y += 1;
}
}
y >= k
}
| null | null |
12 | 001 | null | null | n, l = map(int,input().split())
k = int(input())
a = list(map(int,input().split()))
a.append(l)
dif = [a[0]] # 切り口の差を計算
for i in range(n):
dif.append(a[i + 1] - a[i])
def is_ok(x):
length = 0
cnt = 0
for i in dif:
length += i
if length >= x:
length = 0
cnt += 1
return cnt # 分割する領域の個数
def meguru_bisect(ng, ok):
while ng - ok > 1:
mid = (ng + ok) // 2
if is_ok(mid) >= k + 1: # まだまだ大きくできる
ok = mid
else:
ng = mid # 小さくしなければいけない
return ok
print(meguru_bisect(l + 1, -1)) | null | null | func main()
var n: int :: cui@inputInt()
var l: int :: cui@inputInt()
var k: int :: cui@inputInt()
var a: []int :: #[n + 1]int
for i(0, n - 1)
do a[i] :: cui@inputInt()
end for
do a[n] :: l
var ok: int :: 0
var ng: int :: l + 1
while((ok - ng).abs() > 1)
var mid: int :: (ok + ng) / 2
var prev: int :: 0
var cnt: int :: 0
for i(0, n)
if(a[i] - prev >= mid)
do cnt :+ 1
do prev :: a[i]
end if
end for
var isOk: bool :: cnt >= k + 1
if(isOk)
do ok :: mid
else
do ng :: mid
end if
end while
var ans: int :: ok
do cui@print("\{ans}\n")
end func
| null |
13 | 001 | null | null | null | package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
var sc = bufio.NewScanner(os.Stdin)
func main() {
buf := make([]byte, 1024*1024)
sc.Buffer(buf, bufio.MaxScanTokenSize)
sc.Split(bufio.ScanWords)
n, l := ScanInt(), ScanInt()
k := ScanInt()
a := ScanIntSlice(n)
ok, ng := 0, l
check := func(x int) bool {
preAi := 0
cnt := 0
for i := 0; i < n; i++ {
if a[i]-preAi >= x && l-a[i] >= x {
cnt++
preAi = a[i]
}
}
return cnt >= k
}
for ng-ok > 1 {
c := (ng + ok) / 2
if check(c) {
ok = c
} else {
ng = c
}
}
fmt.Println(ok)
}
func ScanInt() int {
sc.Scan()
i, err := strconv.Atoi(sc.Text())
if err != nil {
panic(err)
}
return i
}
func ScanIntSlice(n int) []int {
s := make([]int, n)
for i := range s {
s[i] = ScanInt()
}
return s
}
| fn main() {
proconio::input! {
n: isize,
l: isize,
k: isize,
mut a: [isize; n]
}
a.sort();
let mut ok = 0;
let mut ng = l + 1;
while (ng - ok).abs() > 1 {
let mid = (ok + ng) / 2;
if is_ok(&a, l, k, mid) {
ok = mid;
} else {
ng = mid;
}
}
println!("{}", ok);
}
fn is_ok(a: &Vec<isize>, l: isize, k: isize, mid: isize) -> bool {
let mut x = 0;
let mut y = 0;
for i in a {
if i - x >= mid && l - i >= mid {
x = *i;
y += 1;
}
}
y >= k
}
| null | null |
14 | 001 | null | null | null | package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
var sc = bufio.NewScanner(os.Stdin)
func main() {
buf := make([]byte, 1024*1024)
sc.Buffer(buf, bufio.MaxScanTokenSize)
sc.Split(bufio.ScanWords)
n, l := ScanInt(), ScanInt()
k := ScanInt()
a := ScanIntSlice(n)
ok, ng := 0, l
check := func(x int) bool {
preAi := 0
cnt := 0
for i := 0; i < n; i++ {
if a[i]-preAi >= x && l-a[i] >= x {
cnt++
preAi = a[i]
}
}
return cnt >= k
}
for ng-ok > 1 {
c := (ng + ok) / 2
if check(c) {
ok = c
} else {
ng = c
}
}
fmt.Println(ok)
}
func ScanInt() int {
sc.Scan()
i, err := strconv.Atoi(sc.Text())
if err != nil {
panic(err)
}
return i
}
func ScanIntSlice(n int) []int {
s := make([]int, n)
for i := range s {
s[i] = ScanInt()
}
return s
}
| null | func main()
var n: int :: cui@inputInt()
var l: int :: cui@inputInt()
var k: int :: cui@inputInt()
var a: []int :: #[n + 1]int
for i(0, n - 1)
do a[i] :: cui@inputInt()
end for
do a[n] :: l
var ok: int :: 0
var ng: int :: l + 1
while((ok - ng).abs() > 1)
var mid: int :: (ok + ng) / 2
var prev: int :: 0
var cnt: int :: 0
for i(0, n)
if(a[i] - prev >= mid)
do cnt :+ 1
do prev :: a[i]
end if
end for
var isOk: bool :: cnt >= k + 1
if(isOk)
do ok :: mid
else
do ng :: mid
end if
end while
var ans: int :: ok
do cui@print("\{ans}\n")
end func
| null |
15 | 001 | null | null | null | null | fn main() {
proconio::input! {
n: isize,
l: isize,
k: isize,
mut a: [isize; n]
}
a.sort();
let mut ok = 0;
let mut ng = l + 1;
while (ng - ok).abs() > 1 {
let mid = (ok + ng) / 2;
if is_ok(&a, l, k, mid) {
ok = mid;
} else {
ng = mid;
}
}
println!("{}", ok);
}
fn is_ok(a: &Vec<isize>, l: isize, k: isize, mid: isize) -> bool {
let mut x = 0;
let mut y = 0;
for i in a {
if i - x >= mid && l - i >= mid {
x = *i;
y += 1;
}
}
y >= k
}
| func main()
var n: int :: cui@inputInt()
var l: int :: cui@inputInt()
var k: int :: cui@inputInt()
var a: []int :: #[n + 1]int
for i(0, n - 1)
do a[i] :: cui@inputInt()
end for
do a[n] :: l
var ok: int :: 0
var ng: int :: l + 1
while((ok - ng).abs() > 1)
var mid: int :: (ok + ng) / 2
var prev: int :: 0
var cnt: int :: 0
for i(0, n)
if(a[i] - prev >= mid)
do cnt :+ 1
do prev :: a[i]
end if
end for
var isOk: bool :: cnt >= k + 1
if(isOk)
do ok :: mid
else
do ng :: mid
end if
end while
var ans: int :: ok
do cui@print("\{ans}\n")
end func
| null |
16 | 002 | // this problem was so fun :)
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define fs(n) fixed << setprecision(n);
#define mp(a, b) make_pair(a, b);
using ll = long long;
using ld = long double;
int n;
int l = 0, r = 0;
vector<string> anslist;
/*
if X is correct brackets string then:
(define length of X = L)
* L is even number
* from 1st to nth chars,
* the count of "(" is greater than or equal to the count of ")" (1 ~ n ~ L - 1)
* the total count of "(" is equal to the total count of ")" is equal to L / 2
*/
void dfs(string s){
if(s.length() == n){
// should consist l = r = n / 2
anslist.emplace_back(s);
return;
}else{
if(r < n / 2){
r++;
dfs(s + "(");
r--;
}
if(l < n / 2 && r > l){
l++;
dfs(s + ")");
l--;
}
}
}
int main(){
// amount of "(" is equal to amount of ")" is equal to n / 2
cin >> n;
if(n % 2) cout << endl;
else{
// generate from 2nd char by dfs
r = 1;
dfs("(");
}
// sort by lexical order ('(' < ')')
sort(anslist.begin(), anslist.end());
for(auto itr = anslist.begin(); itr != anslist.end(); itr++){
cout << *itr << endl;
}
} | n = read_line.to_i
['(', ')'].each_repeated_permutation(n, true) { |s|
a = s.reduce([0]) { |acc, c|
acc << acc[-1] + (c == '(' ? 1 : -1)
}
if a[-1] == 0 && a.all? { |i| i >= 0 }
puts s.join
end
}
| null | null | null | null | null |
17 | 002 | // this problem was so fun :)
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define fs(n) fixed << setprecision(n);
#define mp(a, b) make_pair(a, b);
using ll = long long;
using ld = long double;
int n;
int l = 0, r = 0;
vector<string> anslist;
/*
if X is correct brackets string then:
(define length of X = L)
* L is even number
* from 1st to nth chars,
* the count of "(" is greater than or equal to the count of ")" (1 ~ n ~ L - 1)
* the total count of "(" is equal to the total count of ")" is equal to L / 2
*/
void dfs(string s){
if(s.length() == n){
// should consist l = r = n / 2
anslist.emplace_back(s);
return;
}else{
if(r < n / 2){
r++;
dfs(s + "(");
r--;
}
if(l < n / 2 && r > l){
l++;
dfs(s + ")");
l--;
}
}
}
int main(){
// amount of "(" is equal to amount of ")" is equal to n / 2
cin >> n;
if(n % 2) cout << endl;
else{
// generate from 2nd char by dfs
r = 1;
dfs("(");
}
// sort by lexical order ('(' < ')')
sort(anslist.begin(), anslist.end());
for(auto itr = anslist.begin(); itr != anslist.end(); itr++){
cout << *itr << endl;
}
} | null | from itertools import product
n = int(input())
ans = []
if n % 2 == 0: # 奇数のときは正しいカッコ列を生成できない
for i in product([0, 1], repeat = n): # 0 -> （ , 1 -> ）
if i.count(1) == n // 2: # 0, 1の個数が同じ時に判定を始める
zero_count = 0
Bool = True
word = ""
for j in range(len(i)):
if i[j] == 0:
zero_count += 1
elif i[j] == 1:
if zero_count >= 1: # 0の個数が１個以上ないと正しい文字列にならない
zero_count -= 1
else:
Bool = False
word += str(i[j])
if Bool:
x = word.replace("0", "(")
y = x.replace("1", ")")
ans.append(y)
ans.sort()
print(*ans ,sep = "\n") | null | null | null | null |
18 | 002 | // this problem was so fun :)
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define fs(n) fixed << setprecision(n);
#define mp(a, b) make_pair(a, b);
using ll = long long;
using ld = long double;
int n;
int l = 0, r = 0;
vector<string> anslist;
/*
if X is correct brackets string then:
(define length of X = L)
* L is even number
* from 1st to nth chars,
* the count of "(" is greater than or equal to the count of ")" (1 ~ n ~ L - 1)
* the total count of "(" is equal to the total count of ")" is equal to L / 2
*/
void dfs(string s){
if(s.length() == n){
// should consist l = r = n / 2
anslist.emplace_back(s);
return;
}else{
if(r < n / 2){
r++;
dfs(s + "(");
r--;
}
if(l < n / 2 && r > l){
l++;
dfs(s + ")");
l--;
}
}
}
int main(){
// amount of "(" is equal to amount of ")" is equal to n / 2
cin >> n;
if(n % 2) cout << endl;
else{
// generate from 2nd char by dfs
r = 1;
dfs("(");
}
// sort by lexical order ('(' < ')')
sort(anslist.begin(), anslist.end());
for(auto itr = anslist.begin(); itr != anslist.end(); itr++){
cout << *itr << endl;
}
} | null | null | null | null | null | null |
19 | 002 | // this problem was so fun :)
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define fs(n) fixed << setprecision(n);
#define mp(a, b) make_pair(a, b);
using ll = long long;
using ld = long double;
int n;
int l = 0, r = 0;
vector<string> anslist;
/*
if X is correct brackets string then:
(define length of X = L)
* L is even number
* from 1st to nth chars,
* the count of "(" is greater than or equal to the count of ")" (1 ~ n ~ L - 1)
* the total count of "(" is equal to the total count of ")" is equal to L / 2
*/
void dfs(string s){
if(s.length() == n){
// should consist l = r = n / 2
anslist.emplace_back(s);
return;
}else{
if(r < n / 2){
r++;
dfs(s + "(");
r--;
}
if(l < n / 2 && r > l){
l++;
dfs(s + ")");
l--;
}
}
}
int main(){
// amount of "(" is equal to amount of ")" is equal to n / 2
cin >> n;
if(n % 2) cout << endl;
else{
// generate from 2nd char by dfs
r = 1;
dfs("(");
}
// sort by lexical order ('(' < ')')
sort(anslist.begin(), anslist.end());
for(auto itr = anslist.begin(); itr != anslist.end(); itr++){
cout << *itr << endl;
}
} | null | null | null | null | func main()
var n: int :: cui@inputInt()
if(n % 2 <> 0)
do cui@print("\n")
ret
end if
for i(0, 2 ^ n - 1)
var id: int :: i
var cntOpen: int :: 0
var cntClose: int :: 0
var a: []bool :: #[n]bool
for j(0, n - 1)
do a[j] :: id % 2 = 1
if(a[j])
do cntOpen :+ 1
if(cntOpen > n / 2)
skip i
end if
else
do cntClose :+ 1
if(cntClose > cntOpen)
skip i
end if
end if
do id :/ 2
end for
for j(n - 1, 0, -1)
do cui@print(a[j] ?(")", "("))
end for
do cui@print("\n")
end for
end func
| null |
20 | 002 | null | n = read_line.to_i
['(', ')'].each_repeated_permutation(n, true) { |s|
a = s.reduce([0]) { |acc, c|
acc << acc[-1] + (c == '(' ? 1 : -1)
}
if a[-1] == 0 && a.all? { |i| i >= 0 }
puts s.join
end
}
| from itertools import product
n = int(input())
ans = []
if n % 2 == 0: # 奇数のときは正しいカッコ列を生成できない
for i in product([0, 1], repeat = n): # 0 -> （ , 1 -> ）
if i.count(1) == n // 2: # 0, 1の個数が同じ時に判定を始める
zero_count = 0
Bool = True
word = ""
for j in range(len(i)):
if i[j] == 0:
zero_count += 1
elif i[j] == 1:
if zero_count >= 1: # 0の個数が１個以上ないと正しい文字列にならない
zero_count -= 1
else:
Bool = False
word += str(i[j])
if Bool:
x = word.replace("0", "(")
y = x.replace("1", ")")
ans.append(y)
ans.sort()
print(*ans ,sep = "\n") | null | null | null | null |
21 | 002 | null | n = read_line.to_i
['(', ')'].each_repeated_permutation(n, true) { |s|
a = s.reduce([0]) { |acc, c|
acc << acc[-1] + (c == '(' ? 1 : -1)
}
if a[-1] == 0 && a.all? { |i| i >= 0 }
puts s.join
end
}
| null | null | null | null | null |
22 | 002 | null | n = read_line.to_i
['(', ')'].each_repeated_permutation(n, true) { |s|
a = s.reduce([0]) { |acc, c|
acc << acc[-1] + (c == '(' ? 1 : -1)
}
if a[-1] == 0 && a.all? { |i| i >= 0 }
puts s.join
end
}
| null | null | null | func main()
var n: int :: cui@inputInt()
if(n % 2 <> 0)
do cui@print("\n")
ret
end if
for i(0, 2 ^ n - 1)
var id: int :: i
var cntOpen: int :: 0
var cntClose: int :: 0
var a: []bool :: #[n]bool
for j(0, n - 1)
do a[j] :: id % 2 = 1
if(a[j])
do cntOpen :+ 1
if(cntOpen > n / 2)
skip i
end if
else
do cntClose :+ 1
if(cntClose > cntOpen)
skip i
end if
end if
do id :/ 2
end for
for j(n - 1, 0, -1)
do cui@print(a[j] ?(")", "("))
end for
do cui@print("\n")
end for
end func
| null |
23 | 002 | null | null | from itertools import product
n = int(input())
ans = []
if n % 2 == 0: # 奇数のときは正しいカッコ列を生成できない
for i in product([0, 1], repeat = n): # 0 -> （ , 1 -> ）
if i.count(1) == n // 2: # 0, 1の個数が同じ時に判定を始める
zero_count = 0
Bool = True
word = ""
for j in range(len(i)):
if i[j] == 0:
zero_count += 1
elif i[j] == 1:
if zero_count >= 1: # 0の個数が１個以上ないと正しい文字列にならない
zero_count -= 1
else:
Bool = False
word += str(i[j])
if Bool:
x = word.replace("0", "(")
y = x.replace("1", ")")
ans.append(y)
ans.sort()
print(*ans ,sep = "\n") | null | null | null | null |
24 | 002 | null | null | from itertools import product
n = int(input())
ans = []
if n % 2 == 0: # 奇数のときは正しいカッコ列を生成できない
for i in product([0, 1], repeat = n): # 0 -> （ , 1 -> ）
if i.count(1) == n // 2: # 0, 1の個数が同じ時に判定を始める
zero_count = 0
Bool = True
word = ""
for j in range(len(i)):
if i[j] == 0:
zero_count += 1
elif i[j] == 1:
if zero_count >= 1: # 0の個数が１個以上ないと正しい文字列にならない
zero_count -= 1
else:
Bool = False
word += str(i[j])
if Bool:
x = word.replace("0", "(")
y = x.replace("1", ")")
ans.append(y)
ans.sort()
print(*ans ,sep = "\n") | null | null | func main()
var n: int :: cui@inputInt()
if(n % 2 <> 0)
do cui@print("\n")
ret
end if
for i(0, 2 ^ n - 1)
var id: int :: i
var cntOpen: int :: 0
var cntClose: int :: 0
var a: []bool :: #[n]bool
for j(0, n - 1)
do a[j] :: id % 2 = 1
if(a[j])
do cntOpen :+ 1
if(cntOpen > n / 2)
skip i
end if
else
do cntClose :+ 1
if(cntClose > cntOpen)
skip i
end if
end if
do id :/ 2
end for
for j(n - 1, 0, -1)
do cui@print(a[j] ?(")", "("))
end for
do cui@print("\n")
end for
end func
| null |
25 | 002 | null | null | null | null | null | func main()
var n: int :: cui@inputInt()
if(n % 2 <> 0)
do cui@print("\n")
ret
end if
for i(0, 2 ^ n - 1)
var id: int :: i
var cntOpen: int :: 0
var cntClose: int :: 0
var a: []bool :: #[n]bool
for j(0, n - 1)
do a[j] :: id % 2 = 1
if(a[j])
do cntOpen :+ 1
if(cntOpen > n / 2)
skip i
end if
else
do cntClose :+ 1
if(cntClose > cntOpen)
skip i
end if
end if
do id :/ 2
end for
for j(n - 1, 0, -1)
do cui@print(a[j] ?(")", "("))
end for
do cui@print("\n")
end for
end func
| null |
26 | 003 | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
// 入力
int N;
int A[1 << 18], B[1 << 18];
// グラフ
const int INF = (1 << 29);
vector<int> G[1 << 18];
int dist[1 << 18];
void getdist(int start) {
// 幅優先探索（BFS）により、最短距離を計算
for (int i = 1; i <= N; i++) dist[i] = INF;
queue<int> Q;
Q.push(start);
dist[start] = 0;
while (!Q.empty()) {
int pos = Q.front(); Q.pop();
for (int to : G[pos]) {
if (dist[to] == INF) {
dist[to] = dist[pos] + 1;
Q.push(to);
}
}
}
}
int main() {
// Step #1. 入力
cin >> N;
for (int i = 1; i <= N - 1; i++) {
cin >> A[i] >> B[i];
G[A[i]].push_back(B[i]);
G[B[i]].push_back(A[i]);
}
// Step #2. 頂点 1 からの最短距離を求める
// maxid1: 頂点 1 から最も離れている（最短距離が長い）頂点
getdist(1);
int maxn1 = -1, maxid1 = -1;
for (int i = 1; i <= N; i++) {
if (maxn1 < dist[i]) {
maxn1 = dist[i];
maxid1 = i;
}
}
// Step #3. 頂点 maxid1 からの最短距離を求める
// maxn2: 木の直径（最短距離の最大値）
getdist(maxid1);
int maxn2 = -1;
for (int i = 1; i <= N; i++) {
maxn2 = max(maxn2, dist[i]);
}
// Step #4. 出力
cout << maxn2 + 1 << endl;
return 0;
} | class UnweightedGraph
getter graph : Array(Array(Int32))
def initialize(size : Int)
@graph = Array.new(size) { Array(Int32).new }
end
def add_edge(v, u)
@graph[v] << u
@graph[u] << v
end
delegate size, to: @graph
delegate :[], to: @graph
private def tree_depth_dfs(v : Int32, p : Int32, dist : Int32, a : Array(Int32))
a[v] = dist
self[v].each do |u|
tree_depth_dfs(u, v, dist + 1, a) if u != p
end
end
def tree_depth(root : Int32)
a = Array.new(size, 0)
tree_depth_dfs(root, -1, 0, a)
a
end
end
n = read_line.to_i
graph = UnweightedGraph.new(n)
n.pred.times do
a, b = read_line.split.map(&.to_i.pred)
graph.add_edge(a, b)
end
_, v = graph.tree_depth(0).each_with_index.max
dist, _ = graph.tree_depth(v).each_with_index.max
puts dist + 1
| null | null | null | null | null |
27 | 003 | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
// 入力
int N;
int A[1 << 18], B[1 << 18];
// グラフ
const int INF = (1 << 29);
vector<int> G[1 << 18];
int dist[1 << 18];
void getdist(int start) {
// 幅優先探索（BFS）により、最短距離を計算
for (int i = 1; i <= N; i++) dist[i] = INF;
queue<int> Q;
Q.push(start);
dist[start] = 0;
while (!Q.empty()) {
int pos = Q.front(); Q.pop();
for (int to : G[pos]) {
if (dist[to] == INF) {
dist[to] = dist[pos] + 1;
Q.push(to);
}
}
}
}
int main() {
// Step #1. 入力
cin >> N;
for (int i = 1; i <= N - 1; i++) {
cin >> A[i] >> B[i];
G[A[i]].push_back(B[i]);
G[B[i]].push_back(A[i]);
}
// Step #2. 頂点 1 からの最短距離を求める
// maxid1: 頂点 1 から最も離れている（最短距離が長い）頂点
getdist(1);
int maxn1 = -1, maxid1 = -1;
for (int i = 1; i <= N; i++) {
if (maxn1 < dist[i]) {
maxn1 = dist[i];
maxid1 = i;
}
}
// Step #3. 頂点 maxid1 からの最短距離を求める
// maxn2: 木の直径（最短距離の最大値）
getdist(maxid1);
int maxn2 = -1;
for (int i = 1; i <= N; i++) {
maxn2 = max(maxn2, dist[i]);
}
// Step #4. 出力
cout << maxn2 + 1 << endl;
return 0;
} | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
sys.setrecursionlimit(10**6)
N = int(input())
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(int, input().split())
a, b = a - 1, b - 1
G[a].append(b)
G[b].append(a)
def dfs(s):
D = [-1] * N
D[s] = 0
stk = [s]
push, pop = stk.append, stk.pop
while stk:
v = pop()
nd = D[v] + 1
for nv in G[v]:
if D[nv] >= 0: continue
D[nv] = nd
push(nv)
return D
D0 = dfs(0)
mxi = max(enumerate(D0), key=lambda x: x[1])[0]
Dmx = dfs(mxi)
print(max(Dmx) + 1)
| null | null | null | null |
28 | 003 | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
// 入力
int N;
int A[1 << 18], B[1 << 18];
// グラフ
const int INF = (1 << 29);
vector<int> G[1 << 18];
int dist[1 << 18];
void getdist(int start) {
// 幅優先探索（BFS）により、最短距離を計算
for (int i = 1; i <= N; i++) dist[i] = INF;
queue<int> Q;
Q.push(start);
dist[start] = 0;
while (!Q.empty()) {
int pos = Q.front(); Q.pop();
for (int to : G[pos]) {
if (dist[to] == INF) {
dist[to] = dist[pos] + 1;
Q.push(to);
}
}
}
}
int main() {
// Step #1. 入力
cin >> N;
for (int i = 1; i <= N - 1; i++) {
cin >> A[i] >> B[i];
G[A[i]].push_back(B[i]);
G[B[i]].push_back(A[i]);
}
// Step #2. 頂点 1 からの最短距離を求める
// maxid1: 頂点 1 から最も離れている（最短距離が長い）頂点
getdist(1);
int maxn1 = -1, maxid1 = -1;
for (int i = 1; i <= N; i++) {
if (maxn1 < dist[i]) {
maxn1 = dist[i];
maxid1 = i;
}
}
// Step #3. 頂点 maxid1 からの最短距離を求める
// maxn2: 木の直径（最短距離の最大値）
getdist(maxid1);
int maxn2 = -1;
for (int i = 1; i <= N; i++) {
maxn2 = max(maxn2, dist[i]);
}
// Step #4. 出力
cout << maxn2 + 1 << endl;
return 0;
} | null | null | null | null | null | null |
29 | 003 | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
// 入力
int N;
int A[1 << 18], B[1 << 18];
// グラフ
const int INF = (1 << 29);
vector<int> G[1 << 18];
int dist[1 << 18];
void getdist(int start) {
// 幅優先探索（BFS）により、最短距離を計算
for (int i = 1; i <= N; i++) dist[i] = INF;
queue<int> Q;
Q.push(start);
dist[start] = 0;
while (!Q.empty()) {
int pos = Q.front(); Q.pop();
for (int to : G[pos]) {
if (dist[to] == INF) {
dist[to] = dist[pos] + 1;
Q.push(to);
}
}
}
}
int main() {
// Step #1. 入力
cin >> N;
for (int i = 1; i <= N - 1; i++) {
cin >> A[i] >> B[i];
G[A[i]].push_back(B[i]);
G[B[i]].push_back(A[i]);
}
// Step #2. 頂点 1 からの最短距離を求める
// maxid1: 頂点 1 から最も離れている（最短距離が長い）頂点
getdist(1);
int maxn1 = -1, maxid1 = -1;
for (int i = 1; i <= N; i++) {
if (maxn1 < dist[i]) {
maxn1 = dist[i];
maxid1 = i;
}
}
// Step #3. 頂点 maxid1 からの最短距離を求める
// maxn2: 木の直径（最短距離の最大値）
getdist(maxid1);
int maxn2 = -1;
for (int i = 1; i <= N; i++) {
maxn2 = max(maxn2, dist[i]);
}
// Step #4. 出力
cout << maxn2 + 1 << endl;
return 0;
} | null | null | null | use proconio::{input,marker::Usize1};
use std::collections::VecDeque;
fn main(){
input!{n:usize}
let mut g=vec![vec![];n];
for _ in 1..n{
input!{x:Usize1,y:Usize1}
g[x].push(y);
g[y].push(x);
}
let mut d=vec![1<<30;n];
bfs(&g,&mut d,0usize);
let mut u:usize=0;
let m=d.iter().max().unwrap();
for i in 0..n{
if &d[i]==m {u=i}
}
let mut d=vec![1<<30;n];
bfs(&g,&mut d,u);
println!("{}",1+d.iter().max().unwrap());
}
fn bfs(g:&Vec<Vec<usize>>,d:&mut Vec<isize>,s:usize){
let mut q:VecDeque<usize>=VecDeque::new();
d[s]=0;
q.push_back(s);
while q.len()>0{
let i=q.pop_front().unwrap();
for j in g[i].iter(){
if d[*j]==1<<30{
q.push_back(*j);
d[*j]=d[i]+1;
}
}
}
} | null | null |
30 | 003 | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
// 入力
int N;
int A[1 << 18], B[1 << 18];
// グラフ
const int INF = (1 << 29);
vector<int> G[1 << 18];
int dist[1 << 18];
void getdist(int start) {
// 幅優先探索（BFS）により、最短距離を計算
for (int i = 1; i <= N; i++) dist[i] = INF;
queue<int> Q;
Q.push(start);
dist[start] = 0;
while (!Q.empty()) {
int pos = Q.front(); Q.pop();
for (int to : G[pos]) {
if (dist[to] == INF) {
dist[to] = dist[pos] + 1;
Q.push(to);
}
}
}
}
int main() {
// Step #1. 入力
cin >> N;
for (int i = 1; i <= N - 1; i++) {
cin >> A[i] >> B[i];
G[A[i]].push_back(B[i]);
G[B[i]].push_back(A[i]);
}
// Step #2. 頂点 1 からの最短距離を求める
// maxid1: 頂点 1 から最も離れている（最短距離が長い）頂点
getdist(1);
int maxn1 = -1, maxid1 = -1;
for (int i = 1; i <= N; i++) {
if (maxn1 < dist[i]) {
maxn1 = dist[i];
maxid1 = i;
}
}
// Step #3. 頂点 maxid1 からの最短距離を求める
// maxn2: 木の直径（最短距離の最大値）
getdist(maxid1);
int maxn2 = -1;
for (int i = 1; i <= N; i++) {
maxn2 = max(maxn2, dist[i]);
}
// Step #4. 出力
cout << maxn2 + 1 << endl;
return 0;
} | null | null | null | null | func main()
var n: int :: cui@inputInt()
var graph: []list<int> :: #[n]list<int>
for i(0, n - 1)
do graph[i] :: #list<int>
end for
for i(0, n - 2)
var a: int :: cui@inputInt() - 1
var b: int :: cui@inputInt() - 1
do graph[a].add(b)
do graph[b].add(a)
end for
var ans: int :: treeDiameter(graph) + 1
do cui@print("\{ans}\n")
func treeDiameter(graph: []list<int>): int
var pos: int :: 0
do treeDiameterSub(graph, &pos, -1)
ret treeDiameterSub(graph, &pos, -1)
func treeDiameterSub(graph: []list<int>, pos: &int, p: int): int
var u: int :: pos
var res: int :: 0
do graph[u].head()
while(!graph[u].term())
var x: int :: graph[u].get()
if(x <> p)
var dist: int :: treeDiameterSub(graph, &x, u) + 1
if(dist > res)
do res :: dist
do pos :: x
end if
end if
do graph[u].next()
end while
ret res
end func
end func
end func
| null |
31 | 003 | null | class UnweightedGraph
getter graph : Array(Array(Int32))
def initialize(size : Int)
@graph = Array.new(size) { Array(Int32).new }
end
def add_edge(v, u)
@graph[v] << u
@graph[u] << v
end
delegate size, to: @graph
delegate :[], to: @graph
private def tree_depth_dfs(v : Int32, p : Int32, dist : Int32, a : Array(Int32))
a[v] = dist
self[v].each do |u|
tree_depth_dfs(u, v, dist + 1, a) if u != p
end
end
def tree_depth(root : Int32)
a = Array.new(size, 0)
tree_depth_dfs(root, -1, 0, a)
a
end
end
n = read_line.to_i
graph = UnweightedGraph.new(n)
n.pred.times do
a, b = read_line.split.map(&.to_i.pred)
graph.add_edge(a, b)
end
_, v = graph.tree_depth(0).each_with_index.max
dist, _ = graph.tree_depth(v).each_with_index.max
puts dist + 1
| # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
sys.setrecursionlimit(10**6)
N = int(input())
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(int, input().split())
a, b = a - 1, b - 1
G[a].append(b)
G[b].append(a)
def dfs(s):
D = [-1] * N
D[s] = 0
stk = [s]
push, pop = stk.append, stk.pop
while stk:
v = pop()
nd = D[v] + 1
for nv in G[v]:
if D[nv] >= 0: continue
D[nv] = nd
push(nv)
return D
D0 = dfs(0)
mxi = max(enumerate(D0), key=lambda x: x[1])[0]
Dmx = dfs(mxi)
print(max(Dmx) + 1)
| null | null | null | null |
32 | 003 | null | class UnweightedGraph
getter graph : Array(Array(Int32))
def initialize(size : Int)
@graph = Array.new(size) { Array(Int32).new }
end
def add_edge(v, u)
@graph[v] << u
@graph[u] << v
end
delegate size, to: @graph
delegate :[], to: @graph
private def tree_depth_dfs(v : Int32, p : Int32, dist : Int32, a : Array(Int32))
a[v] = dist
self[v].each do |u|
tree_depth_dfs(u, v, dist + 1, a) if u != p
end
end
def tree_depth(root : Int32)
a = Array.new(size, 0)
tree_depth_dfs(root, -1, 0, a)
a
end
end
n = read_line.to_i
graph = UnweightedGraph.new(n)
n.pred.times do
a, b = read_line.split.map(&.to_i.pred)
graph.add_edge(a, b)
end
_, v = graph.tree_depth(0).each_with_index.max
dist, _ = graph.tree_depth(v).each_with_index.max
puts dist + 1
| null | null | null | null | null |
33 | 003 | null | class UnweightedGraph
getter graph : Array(Array(Int32))
def initialize(size : Int)
@graph = Array.new(size) { Array(Int32).new }
end
def add_edge(v, u)
@graph[v] << u
@graph[u] << v
end
delegate size, to: @graph
delegate :[], to: @graph
private def tree_depth_dfs(v : Int32, p : Int32, dist : Int32, a : Array(Int32))
a[v] = dist
self[v].each do |u|
tree_depth_dfs(u, v, dist + 1, a) if u != p
end
end
def tree_depth(root : Int32)
a = Array.new(size, 0)
tree_depth_dfs(root, -1, 0, a)
a
end
end
n = read_line.to_i
graph = UnweightedGraph.new(n)
n.pred.times do
a, b = read_line.split.map(&.to_i.pred)
graph.add_edge(a, b)
end
_, v = graph.tree_depth(0).each_with_index.max
dist, _ = graph.tree_depth(v).each_with_index.max
puts dist + 1
| null | null | use proconio::{input,marker::Usize1};
use std::collections::VecDeque;
fn main(){
input!{n:usize}
let mut g=vec![vec![];n];
for _ in 1..n{
input!{x:Usize1,y:Usize1}
g[x].push(y);
g[y].push(x);
}
let mut d=vec![1<<30;n];
bfs(&g,&mut d,0usize);
let mut u:usize=0;
let m=d.iter().max().unwrap();
for i in 0..n{
if &d[i]==m {u=i}
}
let mut d=vec![1<<30;n];
bfs(&g,&mut d,u);
println!("{}",1+d.iter().max().unwrap());
}
fn bfs(g:&Vec<Vec<usize>>,d:&mut Vec<isize>,s:usize){
let mut q:VecDeque<usize>=VecDeque::new();
d[s]=0;
q.push_back(s);
while q.len()>0{
let i=q.pop_front().unwrap();
for j in g[i].iter(){
if d[*j]==1<<30{
q.push_back(*j);
d[*j]=d[i]+1;
}
}
}
} | null | null |
34 | 003 | null | class UnweightedGraph
getter graph : Array(Array(Int32))
def initialize(size : Int)
@graph = Array.new(size) { Array(Int32).new }
end
def add_edge(v, u)
@graph[v] << u
@graph[u] << v
end
delegate size, to: @graph
delegate :[], to: @graph
private def tree_depth_dfs(v : Int32, p : Int32, dist : Int32, a : Array(Int32))
a[v] = dist
self[v].each do |u|
tree_depth_dfs(u, v, dist + 1, a) if u != p
end
end
def tree_depth(root : Int32)
a = Array.new(size, 0)
tree_depth_dfs(root, -1, 0, a)
a
end
end
n = read_line.to_i
graph = UnweightedGraph.new(n)
n.pred.times do
a, b = read_line.split.map(&.to_i.pred)
graph.add_edge(a, b)
end
_, v = graph.tree_depth(0).each_with_index.max
dist, _ = graph.tree_depth(v).each_with_index.max
puts dist + 1
| null | null | null | func main()
var n: int :: cui@inputInt()
var graph: []list<int> :: #[n]list<int>
for i(0, n - 1)
do graph[i] :: #list<int>
end for
for i(0, n - 2)
var a: int :: cui@inputInt() - 1
var b: int :: cui@inputInt() - 1
do graph[a].add(b)
do graph[b].add(a)
end for
var ans: int :: treeDiameter(graph) + 1
do cui@print("\{ans}\n")
func treeDiameter(graph: []list<int>): int
var pos: int :: 0
do treeDiameterSub(graph, &pos, -1)
ret treeDiameterSub(graph, &pos, -1)
func treeDiameterSub(graph: []list<int>, pos: &int, p: int): int
var u: int :: pos
var res: int :: 0
do graph[u].head()
while(!graph[u].term())
var x: int :: graph[u].get()
if(x <> p)
var dist: int :: treeDiameterSub(graph, &x, u) + 1
if(dist > res)
do res :: dist
do pos :: x
end if
end if
do graph[u].next()
end while
ret res
end func
end func
end func
| null |
35 | 003 | null | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
sys.setrecursionlimit(10**6)
N = int(input())
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(int, input().split())
a, b = a - 1, b - 1
G[a].append(b)
G[b].append(a)
def dfs(s):
D = [-1] * N
D[s] = 0
stk = [s]
push, pop = stk.append, stk.pop
while stk:
v = pop()
nd = D[v] + 1
for nv in G[v]:
if D[nv] >= 0: continue
D[nv] = nd
push(nv)
return D
D0 = dfs(0)
mxi = max(enumerate(D0), key=lambda x: x[1])[0]
Dmx = dfs(mxi)
print(max(Dmx) + 1)
| null | null | null | null |
36 | 003 | null | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
sys.setrecursionlimit(10**6)
N = int(input())
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(int, input().split())
a, b = a - 1, b - 1
G[a].append(b)
G[b].append(a)
def dfs(s):
D = [-1] * N
D[s] = 0
stk = [s]
push, pop = stk.append, stk.pop
while stk:
v = pop()
nd = D[v] + 1
for nv in G[v]:
if D[nv] >= 0: continue
D[nv] = nd
push(nv)
return D
D0 = dfs(0)
mxi = max(enumerate(D0), key=lambda x: x[1])[0]
Dmx = dfs(mxi)
print(max(Dmx) + 1)
| null | use proconio::{input,marker::Usize1};
use std::collections::VecDeque;
fn main(){
input!{n:usize}
let mut g=vec![vec![];n];
for _ in 1..n{
input!{x:Usize1,y:Usize1}
g[x].push(y);
g[y].push(x);
}
let mut d=vec![1<<30;n];
bfs(&g,&mut d,0usize);
let mut u:usize=0;
let m=d.iter().max().unwrap();
for i in 0..n{
if &d[i]==m {u=i}
}
let mut d=vec![1<<30;n];
bfs(&g,&mut d,u);
println!("{}",1+d.iter().max().unwrap());
}
fn bfs(g:&Vec<Vec<usize>>,d:&mut Vec<isize>,s:usize){
let mut q:VecDeque<usize>=VecDeque::new();
d[s]=0;
q.push_back(s);
while q.len()>0{
let i=q.pop_front().unwrap();
for j in g[i].iter(){
if d[*j]==1<<30{
q.push_back(*j);
d[*j]=d[i]+1;
}
}
}
} | null | null |
37 | 003 | null | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
sys.setrecursionlimit(10**6)
N = int(input())
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(int, input().split())
a, b = a - 1, b - 1
G[a].append(b)
G[b].append(a)
def dfs(s):
D = [-1] * N
D[s] = 0
stk = [s]
push, pop = stk.append, stk.pop
while stk:
v = pop()
nd = D[v] + 1
for nv in G[v]:
if D[nv] >= 0: continue
D[nv] = nd
push(nv)
return D
D0 = dfs(0)
mxi = max(enumerate(D0), key=lambda x: x[1])[0]
Dmx = dfs(mxi)
print(max(Dmx) + 1)
| null | null | func main()
var n: int :: cui@inputInt()
var graph: []list<int> :: #[n]list<int>
for i(0, n - 1)
do graph[i] :: #list<int>
end for
for i(0, n - 2)
var a: int :: cui@inputInt() - 1
var b: int :: cui@inputInt() - 1
do graph[a].add(b)
do graph[b].add(a)
end for
var ans: int :: treeDiameter(graph) + 1
do cui@print("\{ans}\n")
func treeDiameter(graph: []list<int>): int
var pos: int :: 0
do treeDiameterSub(graph, &pos, -1)
ret treeDiameterSub(graph, &pos, -1)
func treeDiameterSub(graph: []list<int>, pos: &int, p: int): int
var u: int :: pos
var res: int :: 0
do graph[u].head()
while(!graph[u].term())
var x: int :: graph[u].get()
if(x <> p)
var dist: int :: treeDiameterSub(graph, &x, u) + 1
if(dist > res)
do res :: dist
do pos :: x
end if
end if
do graph[u].next()
end while
ret res
end func
end func
end func
| null |
38 | 003 | null | null | null | null | use proconio::{input,marker::Usize1};
use std::collections::VecDeque;
fn main(){
input!{n:usize}
let mut g=vec![vec![];n];
for _ in 1..n{
input!{x:Usize1,y:Usize1}
g[x].push(y);
g[y].push(x);
}
let mut d=vec![1<<30;n];
bfs(&g,&mut d,0usize);
let mut u:usize=0;
let m=d.iter().max().unwrap();
for i in 0..n{
if &d[i]==m {u=i}
}
let mut d=vec![1<<30;n];
bfs(&g,&mut d,u);
println!("{}",1+d.iter().max().unwrap());
}
fn bfs(g:&Vec<Vec<usize>>,d:&mut Vec<isize>,s:usize){
let mut q:VecDeque<usize>=VecDeque::new();
d[s]=0;
q.push_back(s);
while q.len()>0{
let i=q.pop_front().unwrap();
for j in g[i].iter(){
if d[*j]==1<<30{
q.push_back(*j);
d[*j]=d[i]+1;
}
}
}
} | null | null |
39 | 003 | null | null | null | null | null | func main()
var n: int :: cui@inputInt()
var graph: []list<int> :: #[n]list<int>
for i(0, n - 1)
do graph[i] :: #list<int>
end for
for i(0, n - 2)
var a: int :: cui@inputInt() - 1
var b: int :: cui@inputInt() - 1
do graph[a].add(b)
do graph[b].add(a)
end for
var ans: int :: treeDiameter(graph) + 1
do cui@print("\{ans}\n")
func treeDiameter(graph: []list<int>): int
var pos: int :: 0
do treeDiameterSub(graph, &pos, -1)
ret treeDiameterSub(graph, &pos, -1)
func treeDiameterSub(graph: []list<int>, pos: &int, p: int): int
var u: int :: pos
var res: int :: 0
do graph[u].head()
while(!graph[u].term())
var x: int :: graph[u].get()
if(x <> p)
var dist: int :: treeDiameterSub(graph, &x, u) + 1
if(dist > res)
do res :: dist
do pos :: x
end if
end if
do graph[u].next()
end while
ret res
end func
end func
end func
| null |
40 | 003 | null | null | null | null | use proconio::{input,marker::Usize1};
use std::collections::VecDeque;
fn main(){
input!{n:usize}
let mut g=vec![vec![];n];
for _ in 1..n{
input!{x:Usize1,y:Usize1}
g[x].push(y);
g[y].push(x);
}
let mut d=vec![1<<30;n];
bfs(&g,&mut d,0usize);
let mut u:usize=0;
let m=d.iter().max().unwrap();
for i in 0..n{
if &d[i]==m {u=i}
}
let mut d=vec![1<<30;n];
bfs(&g,&mut d,u);
println!("{}",1+d.iter().max().unwrap());
}
fn bfs(g:&Vec<Vec<usize>>,d:&mut Vec<isize>,s:usize){
let mut q:VecDeque<usize>=VecDeque::new();
d[s]=0;
q.push_back(s);
while q.len()>0{
let i=q.pop_front().unwrap();
for j in g[i].iter(){
if d[*j]==1<<30{
q.push_back(*j);
d[*j]=d[i]+1;
}
}
}
} | func main()
var n: int :: cui@inputInt()
var graph: []list<int> :: #[n]list<int>
for i(0, n - 1)
do graph[i] :: #list<int>
end for
for i(0, n - 2)
var a: int :: cui@inputInt() - 1
var b: int :: cui@inputInt() - 1
do graph[a].add(b)
do graph[b].add(a)
end for
var ans: int :: treeDiameter(graph) + 1
do cui@print("\{ans}\n")
func treeDiameter(graph: []list<int>): int
var pos: int :: 0
do treeDiameterSub(graph, &pos, -1)
ret treeDiameterSub(graph, &pos, -1)
func treeDiameterSub(graph: []list<int>, pos: &int, p: int): int
var u: int :: pos
var res: int :: 0
do graph[u].head()
while(!graph[u].term())
var x: int :: graph[u].get()
if(x <> p)
var dist: int :: treeDiameterSub(graph, &x, u) + 1
if(dist > res)
do res :: dist
do pos :: x
end if
end if
do graph[u].next()
end while
ret res
end func
end func
end func
| null |
41 | 004 | #include <iostream>
using namespace std;
#pragma warning (disable: 4996)
int H, W;
int A[2009][2009];
int Row[2009], Column[2009];
int Answer[2009][2009];
int main() {
// Step #1. “ü—Í
cin >> H >> W;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
scanf("%d", &A[i][j]);
}
}
// Step #2. ‘OŒvŽZ
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
Row[i] += A[i][j];
Column[j] += A[i][j];
}
}
// Step #3. “š‚¦‚ÌŒvŽZ
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
Answer[i][j] = Row[i] + Column[j] - A[i][j];
}
}
// Step #4. �o—Í
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
if (j >= 2) printf(" ");
printf("%d", Answer[i][j]);
}
printf("\n");
}
return 0;
} | h, w = read_line.split.map(&.to_i)
a = (1..h).map { read_line.split.map(&.to_i) }
row_sum = a.map(&.sum)
column_sum = a.transpose.map(&.sum)
(0...h).each do |i|
puts (0...w).join(' ') { |j|
row_sum[i] + column_sum[j] - a[i][j]
}
end
| null | null | null | null | null |
42 | 004 | null | h, w = read_line.split.map(&.to_i)
a = (1..h).map { read_line.split.map(&.to_i) }
row_sum = a.map(&.sum)
column_sum = a.transpose.map(&.sum)
(0...h).each do |i|
puts (0...w).join(' ') { |j|
row_sum[i] + column_sum[j] - a[i][j]
}
end
| # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main():
input = sys.stdin.readline
H, W = map(int, input().split())
A = [tuple(map(int, input().split())) for _ in range(H)]
R = [sum(A[i]) for i in range(H)]
C = [sum(A[i][j] for i in range(H)) for j in range(W)]
ans = [[R[i] + C[j] - A[i][j] for j in range(W)] for i in range(H)]
for a in ans:
print(*a)
if __name__ == '__main__':
main()
| null | null | null | null |
43 | 004 | null | h, w = read_line.split.map(&.to_i)
a = (1..h).map { read_line.split.map(&.to_i) }
row_sum = a.map(&.sum)
column_sum = a.transpose.map(&.sum)
(0...h).each do |i|
puts (0...w).join(' ') { |j|
row_sum[i] + column_sum[j] - a[i][j]
}
end
| null | null | null | null | null |
44 | 004 | null | h, w = read_line.split.map(&.to_i)
a = (1..h).map { read_line.split.map(&.to_i) }
row_sum = a.map(&.sum)
column_sum = a.transpose.map(&.sum)
(0...h).each do |i|
puts (0...w).join(' ') { |j|
row_sum[i] + column_sum[j] - a[i][j]
}
end
| null | null | null | func main()
var h: int :: cui@inputInt()
var w: int :: cui@inputInt()
do cui@delimiter("")
var s: []char :: cui@inputStr()
var idx: int :: 0
var a: [][]int :: #[h, w]int
var row: []int :: #[h]int
var col: []int :: #[w]int
for y(0, h - 1)
for x(0, w - 1)
var v: int :: 0
while('0' <= s[idx])
do v :* 10
do v :+ s[idx] $ int - '0' $ int
do idx :+ 1
end while
do idx :+ 1
do a[y][x] :: v
do row[y] :+ v
do col[x] :+ v
end for
end for
for y(0, h - 1)
for x(0, w - 1)
do a[y][x] :: row[y] + col[x] - a[y][x]
end for
end for
for y(0, h - 1)
do cui@print(a[y].join(" "))
do cui@print("\n")
end for
end func
| null |
45 | 004 | #include <iostream>
using namespace std;
#pragma warning (disable: 4996)
int H, W;
int A[2009][2009];
int Row[2009], Column[2009];
int Answer[2009][2009];
int main() {
// Step #1. “ü—Í
cin >> H >> W;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
scanf("%d", &A[i][j]);
}
}
// Step #2. ‘OŒvŽZ
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
Row[i] += A[i][j];
Column[j] += A[i][j];
}
}
// Step #3. “š‚¦‚ÌŒvŽZ
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
Answer[i][j] = Row[i] + Column[j] - A[i][j];
}
}
// Step #4. �o—Í
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
if (j >= 2) printf(" ");
printf("%d", Answer[i][j]);
}
printf("\n");
}
return 0;
} | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main():
input = sys.stdin.readline
H, W = map(int, input().split())
A = [tuple(map(int, input().split())) for _ in range(H)]
R = [sum(A[i]) for i in range(H)]
C = [sum(A[i][j] for i in range(H)) for j in range(W)]
ans = [[R[i] + C[j] - A[i][j] for j in range(W)] for i in range(H)]
for a in ans:
print(*a)
if __name__ == '__main__':
main()
| null | null | null | null |
46 | 004 | #include <iostream>
using namespace std;
#pragma warning (disable: 4996)
int H, W;
int A[2009][2009];
int Row[2009], Column[2009];
int Answer[2009][2009];
int main() {
// Step #1. “ü—Í
cin >> H >> W;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
scanf("%d", &A[i][j]);
}
}
// Step #2. ‘OŒvŽZ
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
Row[i] += A[i][j];
Column[j] += A[i][j];
}
}
// Step #3. “š‚¦‚ÌŒvŽZ
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
Answer[i][j] = Row[i] + Column[j] - A[i][j];
}
}
// Step #4. �o—Í
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
if (j >= 2) printf(" ");
printf("%d", Answer[i][j]);
}
printf("\n");
}
return 0;
} | null | null | null | null | null | null |
47 | 004 | #include <iostream>
using namespace std;
#pragma warning (disable: 4996)
int H, W;
int A[2009][2009];
int Row[2009], Column[2009];
int Answer[2009][2009];
int main() {
// Step #1. “ü—Í
cin >> H >> W;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
scanf("%d", &A[i][j]);
}
}
// Step #2. ‘OŒvŽZ
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
Row[i] += A[i][j];
Column[j] += A[i][j];
}
}
// Step #3. “š‚¦‚ÌŒvŽZ
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
Answer[i][j] = Row[i] + Column[j] - A[i][j];
}
}
// Step #4. �o—Í
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
if (j >= 2) printf(" ");
printf("%d", Answer[i][j]);
}
printf("\n");
}
return 0;
} | null | null | null | null | func main()
var h: int :: cui@inputInt()
var w: int :: cui@inputInt()
do cui@delimiter("")
var s: []char :: cui@inputStr()
var idx: int :: 0
var a: [][]int :: #[h, w]int
var row: []int :: #[h]int
var col: []int :: #[w]int
for y(0, h - 1)
for x(0, w - 1)
var v: int :: 0
while('0' <= s[idx])
do v :* 10
do v :+ s[idx] $ int - '0' $ int
do idx :+ 1
end while
do idx :+ 1
do a[y][x] :: v
do row[y] :+ v
do col[x] :+ v
end for
end for
for y(0, h - 1)
for x(0, w - 1)
do a[y][x] :: row[y] + col[x] - a[y][x]
end for
end for
for y(0, h - 1)
do cui@print(a[y].join(" "))
do cui@print("\n")
end for
end func
| null |
48 | 004 | null | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main():
input = sys.stdin.readline
H, W = map(int, input().split())
A = [tuple(map(int, input().split())) for _ in range(H)]
R = [sum(A[i]) for i in range(H)]
C = [sum(A[i][j] for i in range(H)) for j in range(W)]
ans = [[R[i] + C[j] - A[i][j] for j in range(W)] for i in range(H)]
for a in ans:
print(*a)
if __name__ == '__main__':
main()
| null | null | null | null |
49 | 004 | null | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main():
input = sys.stdin.readline
H, W = map(int, input().split())
A = [tuple(map(int, input().split())) for _ in range(H)]
R = [sum(A[i]) for i in range(H)]
C = [sum(A[i][j] for i in range(H)) for j in range(W)]
ans = [[R[i] + C[j] - A[i][j] for j in range(W)] for i in range(H)]
for a in ans:
print(*a)
if __name__ == '__main__':
main()
| null | null | func main()
var h: int :: cui@inputInt()
var w: int :: cui@inputInt()
do cui@delimiter("")
var s: []char :: cui@inputStr()
var idx: int :: 0
var a: [][]int :: #[h, w]int
var row: []int :: #[h]int
var col: []int :: #[w]int
for y(0, h - 1)
for x(0, w - 1)
var v: int :: 0
while('0' <= s[idx])
do v :* 10
do v :+ s[idx] $ int - '0' $ int
do idx :+ 1
end while
do idx :+ 1
do a[y][x] :: v
do row[y] :+ v
do col[x] :+ v
end for
end for
for y(0, h - 1)
for x(0, w - 1)
do a[y][x] :: row[y] + col[x] - a[y][x]
end for
end for
for y(0, h - 1)
do cui@print(a[y].join(" "))
do cui@print("\n")
end for
end func
| null |
50 | 004 | null | null | null | null | null | func main()
var h: int :: cui@inputInt()
var w: int :: cui@inputInt()
do cui@delimiter("")
var s: []char :: cui@inputStr()
var idx: int :: 0
var a: [][]int :: #[h, w]int
var row: []int :: #[h]int
var col: []int :: #[w]int
for y(0, h - 1)
for x(0, w - 1)
var v: int :: 0
while('0' <= s[idx])
do v :* 10
do v :+ s[idx] $ int - '0' $ int
do idx :+ 1
end while
do idx :+ 1
do a[y][x] :: v
do row[y] :+ v
do col[x] :+ v
end for
end for
for y(0, h - 1)
for x(0, w - 1)
do a[y][x] :: row[y] + col[x] - a[y][x]
end for
end for
for y(0, h - 1)
do cui@print(a[y].join(" "))
do cui@print("\n")
end for
end func
| null |
51 | 005 | #include <iostream>
using namespace std;
long long modpow(long long a, long long b, long long m) {
long long p = 1, q = a;
for (int i = 0; i < 63; i++) {
if ((b & (1LL << i)) != 0) {
p *= q;
p %= m;
}
q *= q;
q %= m;
}
return p;
}
const long long mod = 1000000007;
// 入力
long long N, B, K;
long long C[11];
// その他の変数
long long power10[64];
long long DP[64][1009];
long long Answer[64][1009];
int main() {
// Step #1. 入力
cin >> N >> B >> K;
for (int i = 1; i <= K; i++) cin >> C[i];
// Step #2. 前計算
for (int i = 0; i <= 62; i++) {
power10[i] = modpow(10LL, (1LL << i), B);
}
// Step #3. dp[1][i] を求める
for (int i = 1; i <= K; i++) {
DP[0][C[i] % B] += 1;
}
// Step #4. dp[1][i], dp[2][i], ..., dp[2^n][i] を求める
for (int i = 0; i < 62; i++) {
for (int j = 0; j < B; j++) {
for (int k = 0; k < B; k++) {
int nex = (j * power10[i] + k) % B;
DP[i + 1][nex] += DP[i][j] * DP[i][k];
DP[i + 1][nex] %= mod;
}
}
}
// Step #5. 繰り返し二乗法により dp[N][i] を求める
Answer[0][0] = 1;
for (int i = 0; i < 62; i++) {
if ((N & (1LL << i)) != 0LL) {
for (int j = 0; j < B; j++) {
for (int k = 0; k < B; k++) {
int nex = (j * power10[i] + k) % B;
Answer[i + 1][nex] += Answer[i][j] * DP[i][k];
Answer[i + 1][nex] %= mod;
}
}
}
else {
for (int j = 0; j < B; j++) Answer[i + 1][j] = Answer[i][j];
}
}
// Step #6. 出力
cout << Answer[62][0] << endl;
return 0;
} | struct Mint
MOD = 1000000007i64
def self.zero
new
end
def self.raw(value : Int64)
result = new
result.value = value
result
end
@value : Int64
def initialize
@value = 0i64
end
def initialize(value)
@value = value.to_i64 % MOD
end
def initialize(m : self)
@value = m.value
end
protected def value=(value : Int64)
@value = value
end
getter value : Int64
def + : self
self
end
def - : self
Mint.raw(value != 0 ? MOD &- value : 0i64)
end
def +(v)
self + v.to_m
end
def +(m : self)
x = value &+ m.value
x &-= MOD if x >= MOD
Mint.raw(x)
end
def -(v)
self - v.to_m
end
def -(m : self)
x = value &- m.value
x &+= MOD if x < 0
Mint.raw(x)
end
def *(v)
self * v.to_m
end
def *(m : self)
Mint.new(value &* m.value)
end
def /(v)
self / v.to_m
end
def /(m : self)
raise DivisionByZeroError.new if m.value == 0
a, b, u, v = m.to_i64, MOD, 1i64, 0i64
while b != 0
t = a // b
a &-= t &* b
a, b = b, a
u &-= t &* v
u, v = v, u
end
Mint.new(value &* u)
end
def //(v)
self / v
end
def **(exponent : Int)
t, res = self, Mint.raw(1i64)
while exponent > 0
res *= t if exponent & 1 == 1
t *= t
exponent >>= 1
end
res
end
def ==(m : self)
value == m.value
end
def ==(m : Int)
raise NotImplementedError.new("==")
end
def succ
Mint.raw(value != MOD &- 1 ? value &+ 1 : 0i64)
end
def pred
Mint.raw(value != 0 ? value &- 1 : MOD &- 1)
end
def abs
self
end
def to_i64 : Int64
value
end
delegate to_s, to: @value
delegate inspect, to: @value
end
struct Int
{% for op in %w[+ - * / //] %}
def {{op.id}}(value : Mint)
to_m {{op.id}} value
end
{% end %}
def to_m : Mint
Mint.new(self)
end
end
class String
def to_m : Mint
Mint.new(self)
end
end
struct Int
def powmod(exp : T, mod : self) forall T
n = self % mod
res = typeof(self).new(1)
while exp > 0
res = res * n % mod if exp.odd?
n = n * n % mod
exp >>= 1
end
res
end
end
n, b, k = read_line.split.try { |(n, b, k)|
{n.to_i64, b.to_i, k.to_i}
}
a = read_line.split.map(&.to_i)
m = Math.log2(n).ceil.to_i + 1
dp_marge = ->(dp1 : Array(Mint), digit : Int64, dp2 : Array(Mint)) {
dp_res = Array.new(b, Mint.zero)
pow10 = 10.powmod(digit, b)
(0...b).each do |i|
(0...b).each do |j|
dp_res[(i * pow10 + j) % b] += dp1[i] * dp2[j]
end
end
dp_res
}
doubling = Array.new(1) { [Mint.zero] * b }
a.each { |j|
doubling[0][j % b] += 1
}
(1..m).each { |i|
doubling << dp_marge.call(doubling[-1], 2i64**i.pred, doubling[-1])
}
dp = [Mint.zero] * b
dp[0] = 1.to_m
(0..m).select { |i| n.bit(i) == 1 }.each do |i|
dp = dp_marge.call(dp, 2i64**i, doubling[i])
end
puts dp[0]
| null | null | null | null | null |
52 | 005 | #include <iostream>
using namespace std;
long long modpow(long long a, long long b, long long m) {
long long p = 1, q = a;
for (int i = 0; i < 63; i++) {
if ((b & (1LL << i)) != 0) {
p *= q;
p %= m;
}
q *= q;
q %= m;
}
return p;
}
const long long mod = 1000000007;
// 入力
long long N, B, K;
long long C[11];
// その他の変数
long long power10[64];
long long DP[64][1009];
long long Answer[64][1009];
int main() {
// Step #1. 入力
cin >> N >> B >> K;
for (int i = 1; i <= K; i++) cin >> C[i];
// Step #2. 前計算
for (int i = 0; i <= 62; i++) {
power10[i] = modpow(10LL, (1LL << i), B);
}
// Step #3. dp[1][i] を求める
for (int i = 1; i <= K; i++) {
DP[0][C[i] % B] += 1;
}
// Step #4. dp[1][i], dp[2][i], ..., dp[2^n][i] を求める
for (int i = 0; i < 62; i++) {
for (int j = 0; j < B; j++) {
for (int k = 0; k < B; k++) {
int nex = (j * power10[i] + k) % B;
DP[i + 1][nex] += DP[i][j] * DP[i][k];
DP[i + 1][nex] %= mod;
}
}
}
// Step #5. 繰り返し二乗法により dp[N][i] を求める
Answer[0][0] = 1;
for (int i = 0; i < 62; i++) {
if ((N & (1LL << i)) != 0LL) {
for (int j = 0; j < B; j++) {
for (int k = 0; k < B; k++) {
int nex = (j * power10[i] + k) % B;
Answer[i + 1][nex] += Answer[i][j] * DP[i][k];
Answer[i + 1][nex] %= mod;
}
}
}
else {
for (int j = 0; j < B; j++) Answer[i + 1][j] = Answer[i][j];
}
}
// Step #6. 出力
cout << Answer[62][0] << endl;
return 0;
} | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
MOD = 10**9 + 7
def main():
input = sys.stdin.readline
N, B, K = map(int, input().split())
*C, = map(int, input().split())
def f(left, right, shift):
res = [0] * B
for lm in range(B):
for rm in range(B):
nm = (lm * shift + rm) % B
res[nm] = (res[nm] + left[lm] * right[rm]) % MOD
return res
t = [0] * B
# 1桁のとき
for c in C: t[c % B] += 1
ans = [0] * B
ans[0] = 1
shift = 1
for i in range(N.bit_length()):
shift = pow(10, 1 << i, B)
if N & (1 << i):
ans = f(ans, t, shift)
t = f(t, t, shift)
print(ans[0])
if __name__ == '__main__':
main()
| null | null | null | null |
53 | 005 | #include <iostream>
using namespace std;
long long modpow(long long a, long long b, long long m) {
long long p = 1, q = a;
for (int i = 0; i < 63; i++) {
if ((b & (1LL << i)) != 0) {
p *= q;
p %= m;
}
q *= q;
q %= m;
}
return p;
}
const long long mod = 1000000007;
// 入力
long long N, B, K;
long long C[11];
// その他の変数
long long power10[64];
long long DP[64][1009];
long long Answer[64][1009];
int main() {
// Step #1. 入力
cin >> N >> B >> K;
for (int i = 1; i <= K; i++) cin >> C[i];
// Step #2. 前計算
for (int i = 0; i <= 62; i++) {
power10[i] = modpow(10LL, (1LL << i), B);
}
// Step #3. dp[1][i] を求める
for (int i = 1; i <= K; i++) {
DP[0][C[i] % B] += 1;
}
// Step #4. dp[1][i], dp[2][i], ..., dp[2^n][i] を求める
for (int i = 0; i < 62; i++) {
for (int j = 0; j < B; j++) {
for (int k = 0; k < B; k++) {
int nex = (j * power10[i] + k) % B;
DP[i + 1][nex] += DP[i][j] * DP[i][k];
DP[i + 1][nex] %= mod;
}
}
}
// Step #5. 繰り返し二乗法により dp[N][i] を求める
Answer[0][0] = 1;
for (int i = 0; i < 62; i++) {
if ((N & (1LL << i)) != 0LL) {
for (int j = 0; j < B; j++) {
for (int k = 0; k < B; k++) {
int nex = (j * power10[i] + k) % B;
Answer[i + 1][nex] += Answer[i][j] * DP[i][k];
Answer[i + 1][nex] %= mod;
}
}
}
else {
for (int j = 0; j < B; j++) Answer[i + 1][j] = Answer[i][j];
}
}
// Step #6. 出力
cout << Answer[62][0] << endl;
return 0;
} | null | null | null | null | func main()
const mod: int :: 1000000007
var n: int :: cui@inputInt()
var b: int :: cui@inputInt()
var k: int :: cui@inputInt()
var dp: []int :: #[b]int
for i(0, k - 1)
var c: int :: cui@inputInt()
do dp[c % b] :+ 1
end for
var ans: []int :: #[b]int
var pow10: int :: 10 % b
do ans[0] :: 1
while(n > 0)
if(n % 2 = 1)
var ansNext: []int :: #[b]int
for i(0, b - 1)
for j(0, b - 1)
do ansNext[(i * pow10 + j) % b] :+ ans[i] * dp[j]
do ansNext[(i * pow10 + j) % b] :% mod
end for
end for
do ans :: ansNext
end if
block
var dpNext: []int :: #[b]int
for i(0, b - 1)
for j(0, b - 1)
do dpNext[(i * pow10 + j) % b] :+ dp[i] * dp[j]
do dpNext[(i * pow10 + j) % b] :% mod
end for
end for
do dp :: dpNext
end block
do pow10 :: (pow10 ^ 2) % b
do n :/ 2
end while
do cui@print("\{ans[0]}\n")
end func
| null |
54 | 005 | null | struct Mint
MOD = 1000000007i64
def self.zero
new
end
def self.raw(value : Int64)
result = new
result.value = value
result
end
@value : Int64
def initialize
@value = 0i64
end
def initialize(value)
@value = value.to_i64 % MOD
end
def initialize(m : self)
@value = m.value
end
protected def value=(value : Int64)
@value = value
end
getter value : Int64
def + : self
self
end
def - : self
Mint.raw(value != 0 ? MOD &- value : 0i64)
end
def +(v)
self + v.to_m
end
def +(m : self)
x = value &+ m.value
x &-= MOD if x >= MOD
Mint.raw(x)
end
def -(v)
self - v.to_m
end
def -(m : self)
x = value &- m.value
x &+= MOD if x < 0
Mint.raw(x)
end
def *(v)
self * v.to_m
end
def *(m : self)
Mint.new(value &* m.value)
end
def /(v)
self / v.to_m
end
def /(m : self)
raise DivisionByZeroError.new if m.value == 0
a, b, u, v = m.to_i64, MOD, 1i64, 0i64
while b != 0
t = a // b
a &-= t &* b
a, b = b, a
u &-= t &* v
u, v = v, u
end
Mint.new(value &* u)
end
def //(v)
self / v
end
def **(exponent : Int)
t, res = self, Mint.raw(1i64)
while exponent > 0
res *= t if exponent & 1 == 1
t *= t
exponent >>= 1
end
res
end
def ==(m : self)
value == m.value
end
def ==(m : Int)
raise NotImplementedError.new("==")
end
def succ
Mint.raw(value != MOD &- 1 ? value &+ 1 : 0i64)
end
def pred
Mint.raw(value != 0 ? value &- 1 : MOD &- 1)
end
def abs
self
end
def to_i64 : Int64
value
end
delegate to_s, to: @value
delegate inspect, to: @value
end
struct Int
{% for op in %w[+ - * / //] %}
def {{op.id}}(value : Mint)
to_m {{op.id}} value
end
{% end %}
def to_m : Mint
Mint.new(self)
end
end
class String
def to_m : Mint
Mint.new(self)
end
end
struct Int
def powmod(exp : T, mod : self) forall T
n = self % mod
res = typeof(self).new(1)
while exp > 0
res = res * n % mod if exp.odd?
n = n * n % mod
exp >>= 1
end
res
end
end
n, b, k = read_line.split.try { |(n, b, k)|
{n.to_i64, b.to_i, k.to_i}
}
a = read_line.split.map(&.to_i)
m = Math.log2(n).ceil.to_i + 1
dp_marge = ->(dp1 : Array(Mint), digit : Int64, dp2 : Array(Mint)) {
dp_res = Array.new(b, Mint.zero)
pow10 = 10.powmod(digit, b)
(0...b).each do |i|
(0...b).each do |j|
dp_res[(i * pow10 + j) % b] += dp1[i] * dp2[j]
end
end
dp_res
}
doubling = Array.new(1) { [Mint.zero] * b }
a.each { |j|
doubling[0][j % b] += 1
}
(1..m).each { |i|
doubling << dp_marge.call(doubling[-1], 2i64**i.pred, doubling[-1])
}
dp = [Mint.zero] * b
dp[0] = 1.to_m
(0..m).select { |i| n.bit(i) == 1 }.each do |i|
dp = dp_marge.call(dp, 2i64**i, doubling[i])
end
puts dp[0]
| # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
MOD = 10**9 + 7
def main():
input = sys.stdin.readline
N, B, K = map(int, input().split())
*C, = map(int, input().split())
def f(left, right, shift):
res = [0] * B
for lm in range(B):
for rm in range(B):
nm = (lm * shift + rm) % B
res[nm] = (res[nm] + left[lm] * right[rm]) % MOD
return res
t = [0] * B
# 1桁のとき
for c in C: t[c % B] += 1
ans = [0] * B
ans[0] = 1
shift = 1
for i in range(N.bit_length()):
shift = pow(10, 1 << i, B)
if N & (1 << i):
ans = f(ans, t, shift)
t = f(t, t, shift)
print(ans[0])
if __name__ == '__main__':
main()
| null | null | null | null |
55 | 005 | null | struct Mint
MOD = 1000000007i64
def self.zero
new
end
def self.raw(value : Int64)
result = new
result.value = value
result
end
@value : Int64
def initialize
@value = 0i64
end
def initialize(value)
@value = value.to_i64 % MOD
end
def initialize(m : self)
@value = m.value
end
protected def value=(value : Int64)
@value = value
end
getter value : Int64
def + : self
self
end
def - : self
Mint.raw(value != 0 ? MOD &- value : 0i64)
end
def +(v)
self + v.to_m
end
def +(m : self)
x = value &+ m.value
x &-= MOD if x >= MOD
Mint.raw(x)
end
def -(v)
self - v.to_m
end
def -(m : self)
x = value &- m.value
x &+= MOD if x < 0
Mint.raw(x)
end
def *(v)
self * v.to_m
end
def *(m : self)
Mint.new(value &* m.value)
end
def /(v)
self / v.to_m
end
def /(m : self)
raise DivisionByZeroError.new if m.value == 0
a, b, u, v = m.to_i64, MOD, 1i64, 0i64
while b != 0
t = a // b
a &-= t &* b
a, b = b, a
u &-= t &* v
u, v = v, u
end
Mint.new(value &* u)
end
def //(v)
self / v
end
def **(exponent : Int)
t, res = self, Mint.raw(1i64)
while exponent > 0
res *= t if exponent & 1 == 1
t *= t
exponent >>= 1
end
res
end
def ==(m : self)
value == m.value
end
def ==(m : Int)
raise NotImplementedError.new("==")
end
def succ
Mint.raw(value != MOD &- 1 ? value &+ 1 : 0i64)
end
def pred
Mint.raw(value != 0 ? value &- 1 : MOD &- 1)
end
def abs
self
end
def to_i64 : Int64
value
end
delegate to_s, to: @value
delegate inspect, to: @value
end
struct Int
{% for op in %w[+ - * / //] %}
def {{op.id}}(value : Mint)
to_m {{op.id}} value
end
{% end %}
def to_m : Mint
Mint.new(self)
end
end
class String
def to_m : Mint
Mint.new(self)
end
end
struct Int
def powmod(exp : T, mod : self) forall T
n = self % mod
res = typeof(self).new(1)
while exp > 0
res = res * n % mod if exp.odd?
n = n * n % mod
exp >>= 1
end
res
end
end
n, b, k = read_line.split.try { |(n, b, k)|
{n.to_i64, b.to_i, k.to_i}
}
a = read_line.split.map(&.to_i)
m = Math.log2(n).ceil.to_i + 1
dp_marge = ->(dp1 : Array(Mint), digit : Int64, dp2 : Array(Mint)) {
dp_res = Array.new(b, Mint.zero)
pow10 = 10.powmod(digit, b)
(0...b).each do |i|
(0...b).each do |j|
dp_res[(i * pow10 + j) % b] += dp1[i] * dp2[j]
end
end
dp_res
}
doubling = Array.new(1) { [Mint.zero] * b }
a.each { |j|
doubling[0][j % b] += 1
}
(1..m).each { |i|
doubling << dp_marge.call(doubling[-1], 2i64**i.pred, doubling[-1])
}
dp = [Mint.zero] * b
dp[0] = 1.to_m
(0..m).select { |i| n.bit(i) == 1 }.each do |i|
dp = dp_marge.call(dp, 2i64**i, doubling[i])
end
puts dp[0]
| null | null | null | func main()
const mod: int :: 1000000007
var n: int :: cui@inputInt()
var b: int :: cui@inputInt()
var k: int :: cui@inputInt()
var dp: []int :: #[b]int
for i(0, k - 1)
var c: int :: cui@inputInt()
do dp[c % b] :+ 1
end for
var ans: []int :: #[b]int
var pow10: int :: 10 % b
do ans[0] :: 1
while(n > 0)
if(n % 2 = 1)
var ansNext: []int :: #[b]int
for i(0, b - 1)
for j(0, b - 1)
do ansNext[(i * pow10 + j) % b] :+ ans[i] * dp[j]
do ansNext[(i * pow10 + j) % b] :% mod
end for
end for
do ans :: ansNext
end if
block
var dpNext: []int :: #[b]int
for i(0, b - 1)
for j(0, b - 1)
do dpNext[(i * pow10 + j) % b] :+ dp[i] * dp[j]
do dpNext[(i * pow10 + j) % b] :% mod
end for
end for
do dp :: dpNext
end block
do pow10 :: (pow10 ^ 2) % b
do n :/ 2
end while
do cui@print("\{ans[0]}\n")
end func
| null |
56 | 005 | null | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
MOD = 10**9 + 7
def main():
input = sys.stdin.readline
N, B, K = map(int, input().split())
*C, = map(int, input().split())
def f(left, right, shift):
res = [0] * B
for lm in range(B):
for rm in range(B):
nm = (lm * shift + rm) % B
res[nm] = (res[nm] + left[lm] * right[rm]) % MOD
return res
t = [0] * B
# 1桁のとき
for c in C: t[c % B] += 1
ans = [0] * B
ans[0] = 1
shift = 1
for i in range(N.bit_length()):
shift = pow(10, 1 << i, B)
if N & (1 << i):
ans = f(ans, t, shift)
t = f(t, t, shift)
print(ans[0])
if __name__ == '__main__':
main()
| null | null | func main()
const mod: int :: 1000000007
var n: int :: cui@inputInt()
var b: int :: cui@inputInt()
var k: int :: cui@inputInt()
var dp: []int :: #[b]int
for i(0, k - 1)
var c: int :: cui@inputInt()
do dp[c % b] :+ 1
end for
var ans: []int :: #[b]int
var pow10: int :: 10 % b
do ans[0] :: 1
while(n > 0)
if(n % 2 = 1)
var ansNext: []int :: #[b]int
for i(0, b - 1)
for j(0, b - 1)
do ansNext[(i * pow10 + j) % b] :+ ans[i] * dp[j]
do ansNext[(i * pow10 + j) % b] :% mod
end for
end for
do ans :: ansNext
end if
block
var dpNext: []int :: #[b]int
for i(0, b - 1)
for j(0, b - 1)
do dpNext[(i * pow10 + j) % b] :+ dp[i] * dp[j]
do dpNext[(i * pow10 + j) % b] :% mod
end for
end for
do dp :: dpNext
end block
do pow10 :: (pow10 ^ 2) % b
do n :/ 2
end while
do cui@print("\{ans[0]}\n")
end func
| null |
57 | 006 | /*
競プロ典型90問 第6問 s
https://atcoder.jp/contests/typical90/submissions/23191468
*/
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
typedef pair<char, int> P;
int N, K;
string s;
int main()
{
cin >> N >> K;
cin >> s;
priority_queue<P, vector<P>, greater<P>> pq;
//前からN - K + 1個をまず入れる。
for (int i = 0; i < N - K + 1; i++)
pq.push(make_pair(s[i], i));
string ans = "";
int topIdx = -1;
for (int i = 0; i < K; i++)
{
P top;
while (true)
{
top = pq.top();
pq.pop();
if (top.second > topIdx)
break;
}
ans += top.first;
topIdx = top.second;
pq.push(make_pair(s[N - K + 1 + i], N - K + 1 + i));
}
cout << ans << endl;
return 0;
} | n, k = read_line.split.map(&.to_i)
s = read_line
next_index = ('a'..'z').map { |c|
prev_index = n
(0...n).reverse_each.map { |i|
if s[i] == c
prev_index = i
else
prev_index
end
}.to_a.reverse
}
index = 0
puts (1..k).join { |size|
('a'..'z').find { |char|
next_index[char - 'a'][index] <= n - (k - size + 1)
}.not_nil!.tap { |char|
index = next_index[char - 'a'][index] + 1
}
}
| null | null | null | null | null |
58 | 006 | null | n, k = read_line.split.map(&.to_i)
s = read_line
next_index = ('a'..'z').map { |c|
prev_index = n
(0...n).reverse_each.map { |i|
if s[i] == c
prev_index = i
else
prev_index
end
}.to_a.reverse
}
index = 0
puts (1..k).join { |size|
('a'..'z').find { |char|
next_index[char - 'a'][index] <= n - (k - size + 1)
}.not_nil!.tap { |char|
index = next_index[char - 'a'][index] + 1
}
}
| # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
def main():
N, K = map(int, input().split())
S = input()
a = ord('a')
st = SegmentTree(
f=min, identity_factory=lambda: (
27, len(S)), initial_values=[
(ord(s) - a, i) for i, s in enumerate(S)])
ans = []
l = 0
r = len(S) - K
for _ in range(K):
mn = st.query(l, r + 1)
ans.append(mn[0])
l = mn[1] + 1
r += 1
print(''.join(map(lambda x: chr(x + a), ans)))
class SegmentTree:
__slots__ = ('__n', '__d', '__f', '__e')
def __init__(self, n=None, f=max, identity_factory=int, initial_values=None):
assert(n or initial_values)
size = n if n else len(initial_values)
d = [identity_factory() for _ in range(2 * size + 1)]
self.__n, self.__d, self.__f, self.__e = size, d, f, identity_factory
if initial_values:
for i, v in enumerate(initial_values): d[size + i] = v
for i in range(size - 1, 0, -1): d[i] = f(d[i << 1], d[i << 1 | 1])
def get_at(self, index):
return self.__d[index + self.__n]
def set_at(self, index, new_value):
i, d, f = index + self.__n, self.__d, self.__f
if d[i] == new_value: return
d[i], i = new_value, i >> 1
while i: d[i], i = f(d[i << 1], d[i << 1 | 1]), i >> 1
def modify_at(self, index, value):
self.set_at(index, self.__f(self.__d[index + self.__n], value))
def query(self, from_inclusive, to_exclusive):
ans = self.__e()
if to_exclusive <= from_inclusive: return ans
l, r, d, f = from_inclusive + self.__n, to_exclusive + self.__n, self.__d, self.__f
while l < r:
if l & 1: ans, l = f(ans, d[l]), l + 1
if r & 1: ans, r = f(d[r - 1], ans), r - 1
l, r = l >> 1, r >> 1
return ans
def query_all(self):
return self.__d[1]
def bisect_left(self, func, from_inclusive=None, to_exclusive=None):
'''func()がTrueになるもっとも左のindexを探す
'''
n, f, d, v = self.__n, self.__f, self.__d, self.__e()
l = (from_inclusive if from_inclusive else 0) + n
r = (to_exclusive if to_exclusive else n) + n
h = 0
while l < r:
if l & 1:
nv = f(v, d[l])
if func(nv): return self.__single_bisect_left(func, l, v)
v, l = nv, l + 1
l, r, h = l >> 1, r >> 1, h + 1
if r == 0: return n
for i in range(h, 0, -1):
if ((r + 1) << i <= n + n):
nv = f(v, d[r])
if func(nv): return self.__single_bisect_left(func, r, v)
v, r = nv, r + 1
r <<= 1
return n
def __single_bisect_left(self, func, root, left_val):
n, f, d = self.__n, self.__f, self.__d
i, v = root, left_val
while i < n:
i <<= 1
nv = f(v, d[i])
if not func(nv): i, v = i + 1, nv
return i - n
if __name__ == '__main__':
main()
| null | null | null | null |
59 | 006 | null | n, k = read_line.split.map(&.to_i)
s = read_line
next_index = ('a'..'z').map { |c|
prev_index = n
(0...n).reverse_each.map { |i|
if s[i] == c
prev_index = i
else
prev_index
end
}.to_a.reverse
}
index = 0
puts (1..k).join { |size|
('a'..'z').find { |char|
next_index[char - 'a'][index] <= n - (k - size + 1)
}.not_nil!.tap { |char|
index = next_index[char - 'a'][index] + 1
}
}
| null | null | null | func main()
var n: int :: cui@inputInt()
var k: int :: cui@inputInt()
var s: []char :: cui@input()
var nextPos: [][]int :: #[n, 26]int
var pos: []int :: [n].repeat(26)
for i(n - 1, 0, -1)
do pos[s[i] $ int - 'a' $ int] :: i
for j(0, 25)
do nextPos[i][j] :: pos[j]
end for
end for
var p: int :: 0
var ans: []char :: #[k]char
for i(0, k - 1)
for j(0, 25)
var remains: int :: n - 1 - nextPos[p][j]
if(remains >= k - 1 - i)
do ans[i] :: 'a'.offset(j)
do p :: nextPos[p][j] + 1
break j
end if
end for
end for
do cui@print("\{ans}\n")
end func
| null |
60 | 006 | /*
競プロ典型90問 第6問 s
https://atcoder.jp/contests/typical90/submissions/23191468
*/
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
typedef pair<char, int> P;
int N, K;
string s;
int main()
{
cin >> N >> K;
cin >> s;
priority_queue<P, vector<P>, greater<P>> pq;
//前からN - K + 1個をまず入れる。
for (int i = 0; i < N - K + 1; i++)
pq.push(make_pair(s[i], i));
string ans = "";
int topIdx = -1;
for (int i = 0; i < K; i++)
{
P top;
while (true)
{
top = pq.top();
pq.pop();
if (top.second > topIdx)
break;
}
ans += top.first;
topIdx = top.second;
pq.push(make_pair(s[N - K + 1 + i], N - K + 1 + i));
}
cout << ans << endl;
return 0;
} | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
def main():
N, K = map(int, input().split())
S = input()
a = ord('a')
st = SegmentTree(
f=min, identity_factory=lambda: (
27, len(S)), initial_values=[
(ord(s) - a, i) for i, s in enumerate(S)])
ans = []
l = 0
r = len(S) - K
for _ in range(K):
mn = st.query(l, r + 1)
ans.append(mn[0])
l = mn[1] + 1
r += 1
print(''.join(map(lambda x: chr(x + a), ans)))
class SegmentTree:
__slots__ = ('__n', '__d', '__f', '__e')
def __init__(self, n=None, f=max, identity_factory=int, initial_values=None):
assert(n or initial_values)
size = n if n else len(initial_values)
d = [identity_factory() for _ in range(2 * size + 1)]
self.__n, self.__d, self.__f, self.__e = size, d, f, identity_factory
if initial_values:
for i, v in enumerate(initial_values): d[size + i] = v
for i in range(size - 1, 0, -1): d[i] = f(d[i << 1], d[i << 1 | 1])
def get_at(self, index):
return self.__d[index + self.__n]
def set_at(self, index, new_value):
i, d, f = index + self.__n, self.__d, self.__f
if d[i] == new_value: return
d[i], i = new_value, i >> 1
while i: d[i], i = f(d[i << 1], d[i << 1 | 1]), i >> 1
def modify_at(self, index, value):
self.set_at(index, self.__f(self.__d[index + self.__n], value))
def query(self, from_inclusive, to_exclusive):
ans = self.__e()
if to_exclusive <= from_inclusive: return ans
l, r, d, f = from_inclusive + self.__n, to_exclusive + self.__n, self.__d, self.__f
while l < r:
if l & 1: ans, l = f(ans, d[l]), l + 1
if r & 1: ans, r = f(d[r - 1], ans), r - 1
l, r = l >> 1, r >> 1
return ans
def query_all(self):
return self.__d[1]
def bisect_left(self, func, from_inclusive=None, to_exclusive=None):
'''func()がTrueになるもっとも左のindexを探す
'''
n, f, d, v = self.__n, self.__f, self.__d, self.__e()
l = (from_inclusive if from_inclusive else 0) + n
r = (to_exclusive if to_exclusive else n) + n
h = 0
while l < r:
if l & 1:
nv = f(v, d[l])
if func(nv): return self.__single_bisect_left(func, l, v)
v, l = nv, l + 1
l, r, h = l >> 1, r >> 1, h + 1
if r == 0: return n
for i in range(h, 0, -1):
if ((r + 1) << i <= n + n):
nv = f(v, d[r])
if func(nv): return self.__single_bisect_left(func, r, v)
v, r = nv, r + 1
r <<= 1
return n
def __single_bisect_left(self, func, root, left_val):
n, f, d = self.__n, self.__f, self.__d
i, v = root, left_val
while i < n:
i <<= 1
nv = f(v, d[i])
if not func(nv): i, v = i + 1, nv
return i - n
if __name__ == '__main__':
main()
| null | null | null | null |
61 | 006 | /*
競プロ典型90問 第6問 s
https://atcoder.jp/contests/typical90/submissions/23191468
*/
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
typedef pair<char, int> P;
int N, K;
string s;
int main()
{
cin >> N >> K;
cin >> s;
priority_queue<P, vector<P>, greater<P>> pq;
//前からN - K + 1個をまず入れる。
for (int i = 0; i < N - K + 1; i++)
pq.push(make_pair(s[i], i));
string ans = "";
int topIdx = -1;
for (int i = 0; i < K; i++)
{
P top;
while (true)
{
top = pq.top();
pq.pop();
if (top.second > topIdx)
break;
}
ans += top.first;
topIdx = top.second;
pq.push(make_pair(s[N - K + 1 + i], N - K + 1 + i));
}
cout << ans << endl;
return 0;
} | null | null | null | null | func main()
var n: int :: cui@inputInt()
var k: int :: cui@inputInt()
var s: []char :: cui@input()
var nextPos: [][]int :: #[n, 26]int
var pos: []int :: [n].repeat(26)
for i(n - 1, 0, -1)
do pos[s[i] $ int - 'a' $ int] :: i
for j(0, 25)
do nextPos[i][j] :: pos[j]
end for
end for
var p: int :: 0
var ans: []char :: #[k]char
for i(0, k - 1)
for j(0, 25)
var remains: int :: n - 1 - nextPos[p][j]
if(remains >= k - 1 - i)
do ans[i] :: 'a'.offset(j)
do p :: nextPos[p][j] + 1
break j
end if
end for
end for
do cui@print("\{ans}\n")
end func
| null |
62 | 006 | null | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
def main():
N, K = map(int, input().split())
S = input()
a = ord('a')
st = SegmentTree(
f=min, identity_factory=lambda: (
27, len(S)), initial_values=[
(ord(s) - a, i) for i, s in enumerate(S)])
ans = []
l = 0
r = len(S) - K
for _ in range(K):
mn = st.query(l, r + 1)
ans.append(mn[0])
l = mn[1] + 1
r += 1
print(''.join(map(lambda x: chr(x + a), ans)))
class SegmentTree:
__slots__ = ('__n', '__d', '__f', '__e')
def __init__(self, n=None, f=max, identity_factory=int, initial_values=None):
assert(n or initial_values)
size = n if n else len(initial_values)
d = [identity_factory() for _ in range(2 * size + 1)]
self.__n, self.__d, self.__f, self.__e = size, d, f, identity_factory
if initial_values:
for i, v in enumerate(initial_values): d[size + i] = v
for i in range(size - 1, 0, -1): d[i] = f(d[i << 1], d[i << 1 | 1])
def get_at(self, index):
return self.__d[index + self.__n]
def set_at(self, index, new_value):
i, d, f = index + self.__n, self.__d, self.__f
if d[i] == new_value: return
d[i], i = new_value, i >> 1
while i: d[i], i = f(d[i << 1], d[i << 1 | 1]), i >> 1
def modify_at(self, index, value):
self.set_at(index, self.__f(self.__d[index + self.__n], value))
def query(self, from_inclusive, to_exclusive):
ans = self.__e()
if to_exclusive <= from_inclusive: return ans
l, r, d, f = from_inclusive + self.__n, to_exclusive + self.__n, self.__d, self.__f
while l < r:
if l & 1: ans, l = f(ans, d[l]), l + 1
if r & 1: ans, r = f(d[r - 1], ans), r - 1
l, r = l >> 1, r >> 1
return ans
def query_all(self):
return self.__d[1]
def bisect_left(self, func, from_inclusive=None, to_exclusive=None):
'''func()がTrueになるもっとも左のindexを探す
'''
n, f, d, v = self.__n, self.__f, self.__d, self.__e()
l = (from_inclusive if from_inclusive else 0) + n
r = (to_exclusive if to_exclusive else n) + n
h = 0
while l < r:
if l & 1:
nv = f(v, d[l])
if func(nv): return self.__single_bisect_left(func, l, v)
v, l = nv, l + 1
l, r, h = l >> 1, r >> 1, h + 1
if r == 0: return n
for i in range(h, 0, -1):
if ((r + 1) << i <= n + n):
nv = f(v, d[r])
if func(nv): return self.__single_bisect_left(func, r, v)
v, r = nv, r + 1
r <<= 1
return n
def __single_bisect_left(self, func, root, left_val):
n, f, d = self.__n, self.__f, self.__d
i, v = root, left_val
while i < n:
i <<= 1
nv = f(v, d[i])
if not func(nv): i, v = i + 1, nv
return i - n
if __name__ == '__main__':
main()
| null | null | func main()
var n: int :: cui@inputInt()
var k: int :: cui@inputInt()
var s: []char :: cui@input()
var nextPos: [][]int :: #[n, 26]int
var pos: []int :: [n].repeat(26)
for i(n - 1, 0, -1)
do pos[s[i] $ int - 'a' $ int] :: i
for j(0, 25)
do nextPos[i][j] :: pos[j]
end for
end for
var p: int :: 0
var ans: []char :: #[k]char
for i(0, k - 1)
for j(0, 25)
var remains: int :: n - 1 - nextPos[p][j]
if(remains >= k - 1 - i)
do ans[i] :: 'a'.offset(j)
do p :: nextPos[p][j] + 1
break j
end if
end for
end for
do cui@print("\{ans}\n")
end func
| null |
63 | 007 | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int INF = 2000000000;
int N;
int A[300009];
int Q;
int B[300009];
int main() {
// Step #1. Input
cin >> N;
for (int i = 1; i <= N; i++) cin >> A[i];
cin >> Q;
for (int i = 1; i <= Q; i++) cin >> B[i];
// Step #2. Sorting
sort(A + 1, A + N + 1);
// Step #3. Binary Search
for (int i = 1; i <= Q; i++) {
int pos1 = lower_bound(A + 1, A + N + 1, B[i]) - A;
int Diff1 = INF, Diff2 = INF;
if (pos1 <= N) Diff1 = abs(B[i] - A[pos1]);
if (pos1 >= 2) Diff2 = abs(B[i] - A[pos1 - 1]);
cout << min(Diff1, Diff2) << endl;
}
return 0;
}
| read_line
a = [-2*10**9] + read_line.split.map(&.to_i).sort + [2*10**9]
read_line.to_i.times do
b = read_line.to_i
i = a.bsearch_index { |x| x > b }.not_nil!
puts a[i - 1..i + 1].min_of { |x| (b - x).abs }
end
| null | null | null | null | null |
64 | 007 | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int INF = 2000000000;
int N;
int A[300009];
int Q;
int B[300009];
int main() {
// Step #1. Input
cin >> N;
for (int i = 1; i <= N; i++) cin >> A[i];
cin >> Q;
for (int i = 1; i <= Q; i++) cin >> B[i];
// Step #2. Sorting
sort(A + 1, A + N + 1);
// Step #3. Binary Search
for (int i = 1; i <= Q; i++) {
int pos1 = lower_bound(A + 1, A + N + 1, B[i]) - A;
int Diff1 = INF, Diff2 = INF;
if (pos1 <= N) Diff1 = abs(B[i] - A[pos1]);
if (pos1 >= 2) Diff2 = abs(B[i] - A[pos1 - 1]);
cout << min(Diff1, Diff2) << endl;
}
return 0;
}
| null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
from bisect import bisect_left
N = int(input())
*A, = map(int, input().split())
Q = int(input())
A.sort()
for _ in range(Q):
b = int(input())
i = bisect_left(A, b)
u = 10**18
if i < N:
u = min(u, abs(A[i] - b))
if i > 0:
u = min(u, abs(A[i - 1] - b))
print(u)
| null | null | null | null |
65 | 007 | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int INF = 2000000000;
int N;
int A[300009];
int Q;
int B[300009];
int main() {
// Step #1. Input
cin >> N;
for (int i = 1; i <= N; i++) cin >> A[i];
cin >> Q;
for (int i = 1; i <= Q; i++) cin >> B[i];
// Step #2. Sorting
sort(A + 1, A + N + 1);
// Step #3. Binary Search
for (int i = 1; i <= Q; i++) {
int pos1 = lower_bound(A + 1, A + N + 1, B[i]) - A;
int Diff1 = INF, Diff2 = INF;
if (pos1 <= N) Diff1 = abs(B[i] - A[pos1]);
if (pos1 >= 2) Diff2 = abs(B[i] - A[pos1 - 1]);
cout << min(Diff1, Diff2) << endl;
}
return 0;
}
| null | null | null | null | func main()
var n: int :: cui@inputInt()
var a: []int :: #[n]int
for i(0, n - 1)
do a[i] :: cui@inputInt()
end for
do a.sort()
var q: int :: cui@inputInt()
for(1, q)
var b: int :: cui@inputInt()
var ok: int :: 0
var ng: int :: n
while((ok - ng).abs() > 1)
var mid: int :: (ok + ng) / 2
if(a[mid] <= b)
do ok :: mid
else
do ng :: mid
end if
end while
var ans: int :: (b - a[ok]).abs()
if(ok <> n - 1)
do ans :: [ans, a[ok + 1] - b].min()
end if
do cui@print("\{ans}\n")
end for
end func
| null |
66 | 007 | null | read_line
a = [-2*10**9] + read_line.split.map(&.to_i).sort + [2*10**9]
read_line.to_i.times do
b = read_line.to_i
i = a.bsearch_index { |x| x > b }.not_nil!
puts a[i - 1..i + 1].min_of { |x| (b - x).abs }
end
| # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
from bisect import bisect_left
N = int(input())
*A, = map(int, input().split())
Q = int(input())
A.sort()
for _ in range(Q):
b = int(input())
i = bisect_left(A, b)
u = 10**18
if i < N:
u = min(u, abs(A[i] - b))
if i > 0:
u = min(u, abs(A[i - 1] - b))
print(u)
| null | null | null | null |
67 | 007 | null | read_line
a = [-2*10**9] + read_line.split.map(&.to_i).sort + [2*10**9]
read_line.to_i.times do
b = read_line.to_i
i = a.bsearch_index { |x| x > b }.not_nil!
puts a[i - 1..i + 1].min_of { |x| (b - x).abs }
end
| null | null | null | func main()
var n: int :: cui@inputInt()
var a: []int :: #[n]int
for i(0, n - 1)
do a[i] :: cui@inputInt()
end for
do a.sort()
var q: int :: cui@inputInt()
for(1, q)
var b: int :: cui@inputInt()
var ok: int :: 0
var ng: int :: n
while((ok - ng).abs() > 1)
var mid: int :: (ok + ng) / 2
if(a[mid] <= b)
do ok :: mid
else
do ng :: mid
end if
end while
var ans: int :: (b - a[ok]).abs()
if(ok <> n - 1)
do ans :: [ans, a[ok + 1] - b].min()
end if
do cui@print("\{ans}\n")
end for
end func
| null |
68 | 007 | null | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
from bisect import bisect_left
N = int(input())
*A, = map(int, input().split())
Q = int(input())
A.sort()
for _ in range(Q):
b = int(input())
i = bisect_left(A, b)
u = 10**18
if i < N:
u = min(u, abs(A[i] - b))
if i > 0:
u = min(u, abs(A[i - 1] - b))
print(u)
| null | null | func main()
var n: int :: cui@inputInt()
var a: []int :: #[n]int
for i(0, n - 1)
do a[i] :: cui@inputInt()
end for
do a.sort()
var q: int :: cui@inputInt()
for(1, q)
var b: int :: cui@inputInt()
var ok: int :: 0
var ng: int :: n
while((ok - ng).abs() > 1)
var mid: int :: (ok + ng) / 2
if(a[mid] <= b)
do ok :: mid
else
do ng :: mid
end if
end while
var ans: int :: (b - a[ok]).abs()
if(ok <> n - 1)
do ans :: [ans, a[ok + 1] - b].min()
end if
do cui@print("\{ans}\n")
end for
end func
| null |
69 | 008 | #include <iostream>
#include <string>
#include <vector>
#define mod 1000000007
using namespace std;
//19[ms]
string t = "atcoder";
int main(){
int n;
string s;
cin >> n >> s;
vector<vector<int>> dp(8, vector<int>(n + 1));
for(int i = 0; i <= n; i++) dp[0][i] = 1;
for(int i = 0; i < 7; i++){
for(int j = 0; j < n; j++){
if(t[i] == s[j]){
dp[i + 1][j + 1] += dp[i][j];
dp[i + 1][j + 1] %= mod;
}
dp[i + 1][j + 1] += dp[i + 1][j];
dp[i + 1][j + 1] %= mod;
}
}
cout << dp[7][n] << "\n";
} | read_line
s = read_line
atcoder = "?atcoder"
m = atcoder.size
puts s.chars.each_with_object([1] + [0] * m.pred) { |c, dp|
if i = atcoder.index(c)
dp[i] = (dp[i] + dp[i - 1]) % (10**9 + 7)
end
}.last
| null | null | null | null | null |
70 | 008 | #include <iostream>
#include <string>
#include <vector>
#define mod 1000000007
using namespace std;
//19[ms]
string t = "atcoder";
int main(){
int n;
string s;
cin >> n >> s;
vector<vector<int>> dp(8, vector<int>(n + 1));
for(int i = 0; i <= n; i++) dp[0][i] = 1;
for(int i = 0; i < 7; i++){
for(int j = 0; j < n; j++){
if(t[i] == s[j]){
dp[i + 1][j + 1] += dp[i][j];
dp[i + 1][j + 1] %= mod;
}
dp[i + 1][j + 1] += dp[i + 1][j];
dp[i + 1][j + 1] %= mod;
}
}
cout << dp[7][n] << "\n";
} | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
from collections import defaultdict
MOD = 10**9 + 7
N = int(input())
S = input()
C = defaultdict(int)
ATCODER = 'atcoder'
dp = [0] * len(ATCODER)
for s in S[::-1]:
if s in ATCODER:
i = ATCODER.index(s)
if i == len(ATCODER) - 1:
dp[i] += 1
else:
dp[i] = (dp[i] + dp[i + 1]) % MOD
print(dp[0])
| null | null | null | null |
71 | 008 | #include <iostream>
#include <string>
#include <vector>
#define mod 1000000007
using namespace std;
//19[ms]
string t = "atcoder";
int main(){
int n;
string s;
cin >> n >> s;
vector<vector<int>> dp(8, vector<int>(n + 1));
for(int i = 0; i <= n; i++) dp[0][i] = 1;
for(int i = 0; i < 7; i++){
for(int j = 0; j < n; j++){
if(t[i] == s[j]){
dp[i + 1][j + 1] += dp[i][j];
dp[i + 1][j + 1] %= mod;
}
dp[i + 1][j + 1] += dp[i + 1][j];
dp[i + 1][j + 1] %= mod;
}
}
cout << dp[7][n] << "\n";
} | null | null | null | null | func main()
var n: int :: cui@inputInt()
var s: []char :: cui@input()
var atcoder: []char :: "atcoder"
var dp: []int :: #[^atcoder + 1]int
do dp[0] :: 1
for i(0, n - 1)
for j(0, ^atcoder - 1)
if(s[i] = atcoder[j])
do dp[j + 1] :+ dp[j]
do dp[j + 1] :% 10 ^ 9 + 7
end if
end for
end for
var ans: int :: dp[^atcoder]
do cui@print("\{ans}\n")
end func
| null |
72 | 008 | null | read_line
s = read_line
atcoder = "?atcoder"
m = atcoder.size
puts s.chars.each_with_object([1] + [0] * m.pred) { |c, dp|
if i = atcoder.index(c)
dp[i] = (dp[i] + dp[i - 1]) % (10**9 + 7)
end
}.last
| # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
from collections import defaultdict
MOD = 10**9 + 7
N = int(input())
S = input()
C = defaultdict(int)
ATCODER = 'atcoder'
dp = [0] * len(ATCODER)
for s in S[::-1]:
if s in ATCODER:
i = ATCODER.index(s)
if i == len(ATCODER) - 1:
dp[i] += 1
else:
dp[i] = (dp[i] + dp[i + 1]) % MOD
print(dp[0])
| null | null | null | null |
73 | 008 | null | read_line
s = read_line
atcoder = "?atcoder"
m = atcoder.size
puts s.chars.each_with_object([1] + [0] * m.pred) { |c, dp|
if i = atcoder.index(c)
dp[i] = (dp[i] + dp[i - 1]) % (10**9 + 7)
end
}.last
| null | null | null | func main()
var n: int :: cui@inputInt()
var s: []char :: cui@input()
var atcoder: []char :: "atcoder"
var dp: []int :: #[^atcoder + 1]int
do dp[0] :: 1
for i(0, n - 1)
for j(0, ^atcoder - 1)
if(s[i] = atcoder[j])
do dp[j + 1] :+ dp[j]
do dp[j + 1] :% 10 ^ 9 + 7
end if
end for
end for
var ans: int :: dp[^atcoder]
do cui@print("\{ans}\n")
end func
| null |
74 | 008 | null | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
from collections import defaultdict
MOD = 10**9 + 7
N = int(input())
S = input()
C = defaultdict(int)
ATCODER = 'atcoder'
dp = [0] * len(ATCODER)
for s in S[::-1]:
if s in ATCODER:
i = ATCODER.index(s)
if i == len(ATCODER) - 1:
dp[i] += 1
else:
dp[i] = (dp[i] + dp[i + 1]) % MOD
print(dp[0])
| null | null | func main()
var n: int :: cui@inputInt()
var s: []char :: cui@input()
var atcoder: []char :: "atcoder"
var dp: []int :: #[^atcoder + 1]int
do dp[0] :: 1
for i(0, n - 1)
for j(0, ^atcoder - 1)
if(s[i] = atcoder[j])
do dp[j + 1] :+ dp[j]
do dp[j + 1] :% 10 ^ 9 + 7
end if
end for
end for
var ans: int :: dp[^atcoder]
do cui@print("\{ans}\n")
end func
| null |
75 | 009 | #include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
struct Point {
double px, py;
};
Point operator-(const Point& a1, const Point& a2) {
return Point{ a1.px - a2.px, a1.py - a2.py };
}
double getangle(Point G) {
// 点 G の偏角を求める
if (G.py >= 0.0) {
double I = G.px / sqrt(G.px * G.px + G.py * G.py);
double kaku = acos(I) * 180.0 / 3.14159265358979;
return kaku;
}
else {
double I = G.px / sqrt(G.px * G.px + G.py * G.py);
double kaku = acos(I) * 180.0 / 3.14159265358979;
return 360.0 - kaku;
}
}
double getangle2(double I1, double I2) {
// [偏角 I1] - [原点] - [偏角 I2] のなす角度を求める
// 例えば I1 = 240°、I2 = 30°のとき、求める角度は 150°
double res = abs(I1 - I2);
if (res >= 180.0) return 360.0 - res;
return res;
}
int N;
Point G[2009];
double solve(int pos) {
// 最初に偏角の昇順にソートする
vector<double> vec;
for (int i = 1; i <= N; i++) {
if (i == pos) continue;
Point SA = G[i] - G[pos];
double angle = getangle(SA);
vec.push_back(angle);
}
sort(vec.begin(), vec.end());
// 点 A を全探索して、最も偏角の大きくなる点 C を二分探索（std::lower_bound）で求める
double ret = 0.0;
for (int i = 0; i < vec.size(); i++) {
double target = vec[i] + 180.0;
if (target >= 360.0) target -= 360.0;
int pos1 = lower_bound(vec.begin(), vec.end(), target) - vec.begin();
// 点 C の候補は高々 2 つに絞れる
int CandIdx1 = pos1 % vec.size();
int CandIdx2 = (pos1 + vec.size() - 1) % vec.size();
double Candidate1 = getangle2(vec[i], vec[CandIdx1]);
double Candidate2 = getangle2(vec[i], vec[CandIdx2]);
ret = max({ ret, Candidate1, Candidate2 });
}
return ret;
}
// O(N^3) のアルゴリズム（点 A, B, C を全探索）
double solve_Slow() {
double Answer = 0.0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
for (int k = 1; k <= N; k++) {
if (i == j || i == k || j == k) continue;
double I1 = getangle(G[i] - G[j]);
double I2 = getangle(G[k] - G[j]);
Answer = max(Answer, getangle2(I1, I2));
}
}
}
return Answer;
}
// O(N^2 log N) のアルゴリズム
double solve_Fast() {
// 点 B を全探索
double Answer = 0.0;
for (int i = 1; i <= N; i++) {
double ret = solve(i);
Answer = max(Answer, ret);
}
return Answer;
}
int main() {
// Step #1. 入力
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> G[i].px >> G[i].py;
}
// Step #2. 出力
double FinalAns = solve_Fast();
printf("%.12lf\n", FinalAns);
return 0;
} | # 0.36.0 以降は Math::TAU があります
TAU = Math::PI * 2
n = read_line.to_i
xy = (1..n).map {
{Int32, Int32}.from read_line.split.map(&.to_i)
}
puts (0...n).max_of { |i|
angle = (0...n).select { |j| i != j }.map { |j|
Math.atan2(xy[j][1] - xy[i][1], xy[j][0] - xy[i][0])
}
angles = angle.flat_map { |a| [a, a + Math::PI * 2] }.sort
angle.max_of { |a|
index = angles.bsearch_index { |b| b >= a + Math::PI }.not_nil!
{angles[index - 1], angles[index]}.max_of { |b|
res = (b - a) % TAU
res > Math::PI ? Math::PI - res : res
}
}
} * 360 / TAU
| null | null | null | null | null |
76 | 009 | #include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
struct Point {
double px, py;
};
Point operator-(const Point& a1, const Point& a2) {
return Point{ a1.px - a2.px, a1.py - a2.py };
}
double getangle(Point G) {
// 点 G の偏角を求める
if (G.py >= 0.0) {
double I = G.px / sqrt(G.px * G.px + G.py * G.py);
double kaku = acos(I) * 180.0 / 3.14159265358979;
return kaku;
}
else {
double I = G.px / sqrt(G.px * G.px + G.py * G.py);
double kaku = acos(I) * 180.0 / 3.14159265358979;
return 360.0 - kaku;
}
}
double getangle2(double I1, double I2) {
// [偏角 I1] - [原点] - [偏角 I2] のなす角度を求める
// 例えば I1 = 240°、I2 = 30°のとき、求める角度は 150°
double res = abs(I1 - I2);
if (res >= 180.0) return 360.0 - res;
return res;
}
int N;
Point G[2009];
double solve(int pos) {
// 最初に偏角の昇順にソートする
vector<double> vec;
for (int i = 1; i <= N; i++) {
if (i == pos) continue;
Point SA = G[i] - G[pos];
double angle = getangle(SA);
vec.push_back(angle);
}
sort(vec.begin(), vec.end());
// 点 A を全探索して、最も偏角の大きくなる点 C を二分探索（std::lower_bound）で求める
double ret = 0.0;
for (int i = 0; i < vec.size(); i++) {
double target = vec[i] + 180.0;
if (target >= 360.0) target -= 360.0;
int pos1 = lower_bound(vec.begin(), vec.end(), target) - vec.begin();
// 点 C の候補は高々 2 つに絞れる
int CandIdx1 = pos1 % vec.size();
int CandIdx2 = (pos1 + vec.size() - 1) % vec.size();
double Candidate1 = getangle2(vec[i], vec[CandIdx1]);
double Candidate2 = getangle2(vec[i], vec[CandIdx2]);
ret = max({ ret, Candidate1, Candidate2 });
}
return ret;
}
// O(N^3) のアルゴリズム（点 A, B, C を全探索）
double solve_Slow() {
double Answer = 0.0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
for (int k = 1; k <= N; k++) {
if (i == j || i == k || j == k) continue;
double I1 = getangle(G[i] - G[j]);
double I2 = getangle(G[k] - G[j]);
Answer = max(Answer, getangle2(I1, I2));
}
}
}
return Answer;
}
// O(N^2 log N) のアルゴリズム
double solve_Fast() {
// 点 B を全探索
double Answer = 0.0;
for (int i = 1; i <= N; i++) {
double ret = solve(i);
Answer = max(Answer, ret);
}
return Answer;
}
int main() {
// Step #1. 入力
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> G[i].px >> G[i].py;
}
// Step #2. 出力
double FinalAns = solve_Fast();
printf("%.12lf\n", FinalAns);
return 0;
} | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
from bisect import bisect_left
from cmath import phase, pi
from typing import List
C = 2 * pi
N = int(input())
P: List[complex] = []
for _ in range(N):
x, y = map(int, input().split())
P.append(x + y * 1j)
ans = 0
for i in range(N):
A = sorted((phase(P[j] - P[i]) + pi) * 360 / C for j in range(N) if i != j)
now = 0
for Aj in A:
k = bisect_left(A, Aj + 180)
r = A[k % len(A)] - Aj
if r < 0: r += 360
if r > 180: r = 360 - r
l = A[k % len(A) - 1] - Aj
if l < 0: l += 360
if l > 180: l = 360 - l
now = max(now, l, r)
ans = max(ans, now)
print(ans)
| null | null | null | null |
77 | 009 | #include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
struct Point {
double px, py;
};
Point operator-(const Point& a1, const Point& a2) {
return Point{ a1.px - a2.px, a1.py - a2.py };
}
double getangle(Point G) {
// 点 G の偏角を求める
if (G.py >= 0.0) {
double I = G.px / sqrt(G.px * G.px + G.py * G.py);
double kaku = acos(I) * 180.0 / 3.14159265358979;
return kaku;
}
else {
double I = G.px / sqrt(G.px * G.px + G.py * G.py);
double kaku = acos(I) * 180.0 / 3.14159265358979;
return 360.0 - kaku;
}
}
double getangle2(double I1, double I2) {
// [偏角 I1] - [原点] - [偏角 I2] のなす角度を求める
// 例えば I1 = 240°、I2 = 30°のとき、求める角度は 150°
double res = abs(I1 - I2);
if (res >= 180.0) return 360.0 - res;
return res;
}
int N;
Point G[2009];
double solve(int pos) {
// 最初に偏角の昇順にソートする
vector<double> vec;
for (int i = 1; i <= N; i++) {
if (i == pos) continue;
Point SA = G[i] - G[pos];
double angle = getangle(SA);
vec.push_back(angle);
}
sort(vec.begin(), vec.end());
// 点 A を全探索して、最も偏角の大きくなる点 C を二分探索（std::lower_bound）で求める
double ret = 0.0;
for (int i = 0; i < vec.size(); i++) {
double target = vec[i] + 180.0;
if (target >= 360.0) target -= 360.0;
int pos1 = lower_bound(vec.begin(), vec.end(), target) - vec.begin();
// 点 C の候補は高々 2 つに絞れる
int CandIdx1 = pos1 % vec.size();
int CandIdx2 = (pos1 + vec.size() - 1) % vec.size();
double Candidate1 = getangle2(vec[i], vec[CandIdx1]);
double Candidate2 = getangle2(vec[i], vec[CandIdx2]);
ret = max({ ret, Candidate1, Candidate2 });
}
return ret;
}
// O(N^3) のアルゴリズム（点 A, B, C を全探索）
double solve_Slow() {
double Answer = 0.0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
for (int k = 1; k <= N; k++) {
if (i == j || i == k || j == k) continue;
double I1 = getangle(G[i] - G[j]);
double I2 = getangle(G[k] - G[j]);
Answer = max(Answer, getangle2(I1, I2));
}
}
}
return Answer;
}
// O(N^2 log N) のアルゴリズム
double solve_Fast() {
// 点 B を全探索
double Answer = 0.0;
for (int i = 1; i <= N; i++) {
double ret = solve(i);
Answer = max(Answer, ret);
}
return Answer;
}
int main() {
// Step #1. 入力
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> G[i].px >> G[i].py;
}
// Step #2. 出力
double FinalAns = solve_Fast();
printf("%.12lf\n", FinalAns);
return 0;
} | null | null | null | null | null | null |
78 | 009 | #include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
struct Point {
double px, py;
};
Point operator-(const Point& a1, const Point& a2) {
return Point{ a1.px - a2.px, a1.py - a2.py };
}
double getangle(Point G) {
// 点 G の偏角を求める
if (G.py >= 0.0) {
double I = G.px / sqrt(G.px * G.px + G.py * G.py);
double kaku = acos(I) * 180.0 / 3.14159265358979;
return kaku;
}
else {
double I = G.px / sqrt(G.px * G.px + G.py * G.py);
double kaku = acos(I) * 180.0 / 3.14159265358979;
return 360.0 - kaku;
}
}
double getangle2(double I1, double I2) {
// [偏角 I1] - [原点] - [偏角 I2] のなす角度を求める
// 例えば I1 = 240°、I2 = 30°のとき、求める角度は 150°
double res = abs(I1 - I2);
if (res >= 180.0) return 360.0 - res;
return res;
}
int N;
Point G[2009];
double solve(int pos) {
// 最初に偏角の昇順にソートする
vector<double> vec;
for (int i = 1; i <= N; i++) {
if (i == pos) continue;
Point SA = G[i] - G[pos];
double angle = getangle(SA);
vec.push_back(angle);
}
sort(vec.begin(), vec.end());
// 点 A を全探索して、最も偏角の大きくなる点 C を二分探索（std::lower_bound）で求める
double ret = 0.0;
for (int i = 0; i < vec.size(); i++) {
double target = vec[i] + 180.0;
if (target >= 360.0) target -= 360.0;
int pos1 = lower_bound(vec.begin(), vec.end(), target) - vec.begin();
// 点 C の候補は高々 2 つに絞れる
int CandIdx1 = pos1 % vec.size();
int CandIdx2 = (pos1 + vec.size() - 1) % vec.size();
double Candidate1 = getangle2(vec[i], vec[CandIdx1]);
double Candidate2 = getangle2(vec[i], vec[CandIdx2]);
ret = max({ ret, Candidate1, Candidate2 });
}
return ret;
}
// O(N^3) のアルゴリズム（点 A, B, C を全探索）
double solve_Slow() {
double Answer = 0.0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
for (int k = 1; k <= N; k++) {
if (i == j || i == k || j == k) continue;
double I1 = getangle(G[i] - G[j]);
double I2 = getangle(G[k] - G[j]);
Answer = max(Answer, getangle2(I1, I2));
}
}
}
return Answer;
}
// O(N^2 log N) のアルゴリズム
double solve_Fast() {
// 点 B を全探索
double Answer = 0.0;
for (int i = 1; i <= N; i++) {
double ret = solve(i);
Answer = max(Answer, ret);
}
return Answer;
}
int main() {
// Step #1. 入力
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> G[i].px >> G[i].py;
}
// Step #2. 出力
double FinalAns = solve_Fast();
printf("%.12lf\n", FinalAns);
return 0;
} | null | null | null | null | func main()
var n: int :: cui@inputInt()
var x: []float :: #[n]float
var y: []float :: #[n]float
for i(0, n - 1)
do x[i] :: cui@inputFloat()
do y[i] :: cui@inputFloat()
end for
var ans: float :: 0.0
for i(0, n - 1)
var rots: []float :: #[n]float
for j(0, n - 1)
if(i = j)
if(i = 0)
do rots[j] :: lib@invRot(x[j + 1], y[j + 1], x[i], y[i])
else
do rots[j] :: lib@invRot(x[j - 1], y[j - 1], x[i], y[i])
end if
else
do rots[j] :: lib@invRot(x[j], y[j], x[i], y[i])
end if
end for
do rots.sort()
var rots2: []float :: #[2 * n]float
for j(0, n - 1)
do rots2[j] :: rots[j]
end for
for j(n, 2 * n - 1)
do rots2[j] :: rots[j - n] + 2.0 * lib@pi
end for
for j(0, n - 1)
var target: float :: rots[j] + lib@pi
var ok: int :: j
var ng: int :: j + n
while((ok - ng).abs() > 1)
var mid: int :: (ok + ng) / 2
if(rots2[mid] <= target)
do ok :: mid
else
do ng :: mid
end if
end while
do ans :: [ans, f(rots2[ok] - rots[j])].max()
do ans :: [ans, f(rots2[ok + 1] - rots[j])].max()
end for
end for
do cui@print("\{lib@toDegree(ans)}\n")
func f(t: float): float
if(t > lib@pi)
do t :: 2.0 * lib@pi - t
end if
ret t
end func
end func
| null |
79 | 009 | null | # 0.36.0 以降は Math::TAU があります
TAU = Math::PI * 2
n = read_line.to_i
xy = (1..n).map {
{Int32, Int32}.from read_line.split.map(&.to_i)
}
puts (0...n).max_of { |i|
angle = (0...n).select { |j| i != j }.map { |j|
Math.atan2(xy[j][1] - xy[i][1], xy[j][0] - xy[i][0])
}
angles = angle.flat_map { |a| [a, a + Math::PI * 2] }.sort
angle.max_of { |a|
index = angles.bsearch_index { |b| b >= a + Math::PI }.not_nil!
{angles[index - 1], angles[index]}.max_of { |b|
res = (b - a) % TAU
res > Math::PI ? Math::PI - res : res
}
}
} * 360 / TAU
| # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
from bisect import bisect_left
from cmath import phase, pi
from typing import List
C = 2 * pi
N = int(input())
P: List[complex] = []
for _ in range(N):
x, y = map(int, input().split())
P.append(x + y * 1j)
ans = 0
for i in range(N):
A = sorted((phase(P[j] - P[i]) + pi) * 360 / C for j in range(N) if i != j)
now = 0
for Aj in A:
k = bisect_left(A, Aj + 180)
r = A[k % len(A)] - Aj
if r < 0: r += 360
if r > 180: r = 360 - r
l = A[k % len(A) - 1] - Aj
if l < 0: l += 360
if l > 180: l = 360 - l
now = max(now, l, r)
ans = max(ans, now)
print(ans)
| null | null | null | null |
80 | 009 | null | # 0.36.0 以降は Math::TAU があります
TAU = Math::PI * 2
n = read_line.to_i
xy = (1..n).map {
{Int32, Int32}.from read_line.split.map(&.to_i)
}
puts (0...n).max_of { |i|
angle = (0...n).select { |j| i != j }.map { |j|
Math.atan2(xy[j][1] - xy[i][1], xy[j][0] - xy[i][0])
}
angles = angle.flat_map { |a| [a, a + Math::PI * 2] }.sort
angle.max_of { |a|
index = angles.bsearch_index { |b| b >= a + Math::PI }.not_nil!
{angles[index - 1], angles[index]}.max_of { |b|
res = (b - a) % TAU
res > Math::PI ? Math::PI - res : res
}
}
} * 360 / TAU
| null | null | null | null | null |
81 | 009 | null | # 0.36.0 以降は Math::TAU があります
TAU = Math::PI * 2
n = read_line.to_i
xy = (1..n).map {
{Int32, Int32}.from read_line.split.map(&.to_i)
}
puts (0...n).max_of { |i|
angle = (0...n).select { |j| i != j }.map { |j|
Math.atan2(xy[j][1] - xy[i][1], xy[j][0] - xy[i][0])
}
angles = angle.flat_map { |a| [a, a + Math::PI * 2] }.sort
angle.max_of { |a|
index = angles.bsearch_index { |b| b >= a + Math::PI }.not_nil!
{angles[index - 1], angles[index]}.max_of { |b|
res = (b - a) % TAU
res > Math::PI ? Math::PI - res : res
}
}
} * 360 / TAU
| null | null | null | func main()
var n: int :: cui@inputInt()
var x: []float :: #[n]float
var y: []float :: #[n]float
for i(0, n - 1)
do x[i] :: cui@inputFloat()
do y[i] :: cui@inputFloat()
end for
var ans: float :: 0.0
for i(0, n - 1)
var rots: []float :: #[n]float
for j(0, n - 1)
if(i = j)
if(i = 0)
do rots[j] :: lib@invRot(x[j + 1], y[j + 1], x[i], y[i])
else
do rots[j] :: lib@invRot(x[j - 1], y[j - 1], x[i], y[i])
end if
else
do rots[j] :: lib@invRot(x[j], y[j], x[i], y[i])
end if
end for
do rots.sort()
var rots2: []float :: #[2 * n]float
for j(0, n - 1)
do rots2[j] :: rots[j]
end for
for j(n, 2 * n - 1)
do rots2[j] :: rots[j - n] + 2.0 * lib@pi
end for
for j(0, n - 1)
var target: float :: rots[j] + lib@pi
var ok: int :: j
var ng: int :: j + n
while((ok - ng).abs() > 1)
var mid: int :: (ok + ng) / 2
if(rots2[mid] <= target)
do ok :: mid
else
do ng :: mid
end if
end while
do ans :: [ans, f(rots2[ok] - rots[j])].max()
do ans :: [ans, f(rots2[ok + 1] - rots[j])].max()
end for
end for
do cui@print("\{lib@toDegree(ans)}\n")
func f(t: float): float
if(t > lib@pi)
do t :: 2.0 * lib@pi - t
end if
ret t
end func
end func
| null |
82 | 009 | null | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
from bisect import bisect_left
from cmath import phase, pi
from typing import List
C = 2 * pi
N = int(input())
P: List[complex] = []
for _ in range(N):
x, y = map(int, input().split())
P.append(x + y * 1j)
ans = 0
for i in range(N):
A = sorted((phase(P[j] - P[i]) + pi) * 360 / C for j in range(N) if i != j)
now = 0
for Aj in A:
k = bisect_left(A, Aj + 180)
r = A[k % len(A)] - Aj
if r < 0: r += 360
if r > 180: r = 360 - r
l = A[k % len(A) - 1] - Aj
if l < 0: l += 360
if l > 180: l = 360 - l
now = max(now, l, r)
ans = max(ans, now)
print(ans)
| null | null | null | null |
83 | 009 | null | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
from bisect import bisect_left
from cmath import phase, pi
from typing import List
C = 2 * pi
N = int(input())
P: List[complex] = []
for _ in range(N):
x, y = map(int, input().split())
P.append(x + y * 1j)
ans = 0
for i in range(N):
A = sorted((phase(P[j] - P[i]) + pi) * 360 / C for j in range(N) if i != j)
now = 0
for Aj in A:
k = bisect_left(A, Aj + 180)
r = A[k % len(A)] - Aj
if r < 0: r += 360
if r > 180: r = 360 - r
l = A[k % len(A) - 1] - Aj
if l < 0: l += 360
if l > 180: l = 360 - l
now = max(now, l, r)
ans = max(ans, now)
print(ans)
| null | null | func main()
var n: int :: cui@inputInt()
var x: []float :: #[n]float
var y: []float :: #[n]float
for i(0, n - 1)
do x[i] :: cui@inputFloat()
do y[i] :: cui@inputFloat()
end for
var ans: float :: 0.0
for i(0, n - 1)
var rots: []float :: #[n]float
for j(0, n - 1)
if(i = j)
if(i = 0)
do rots[j] :: lib@invRot(x[j + 1], y[j + 1], x[i], y[i])
else
do rots[j] :: lib@invRot(x[j - 1], y[j - 1], x[i], y[i])
end if
else
do rots[j] :: lib@invRot(x[j], y[j], x[i], y[i])
end if
end for
do rots.sort()
var rots2: []float :: #[2 * n]float
for j(0, n - 1)
do rots2[j] :: rots[j]
end for
for j(n, 2 * n - 1)
do rots2[j] :: rots[j - n] + 2.0 * lib@pi
end for
for j(0, n - 1)
var target: float :: rots[j] + lib@pi
var ok: int :: j
var ng: int :: j + n
while((ok - ng).abs() > 1)
var mid: int :: (ok + ng) / 2
if(rots2[mid] <= target)
do ok :: mid
else
do ng :: mid
end if
end while
do ans :: [ans, f(rots2[ok] - rots[j])].max()
do ans :: [ans, f(rots2[ok + 1] - rots[j])].max()
end for
end for
do cui@print("\{lib@toDegree(ans)}\n")
func f(t: float): float
if(t > lib@pi)
do t :: 2.0 * lib@pi - t
end if
ret t
end func
end func
| null |
84 | 009 | null | null | null | null | null | func main()
var n: int :: cui@inputInt()
var x: []float :: #[n]float
var y: []float :: #[n]float
for i(0, n - 1)
do x[i] :: cui@inputFloat()
do y[i] :: cui@inputFloat()
end for
var ans: float :: 0.0
for i(0, n - 1)
var rots: []float :: #[n]float
for j(0, n - 1)
if(i = j)
if(i = 0)
do rots[j] :: lib@invRot(x[j + 1], y[j + 1], x[i], y[i])
else
do rots[j] :: lib@invRot(x[j - 1], y[j - 1], x[i], y[i])
end if
else
do rots[j] :: lib@invRot(x[j], y[j], x[i], y[i])
end if
end for
do rots.sort()
var rots2: []float :: #[2 * n]float
for j(0, n - 1)
do rots2[j] :: rots[j]
end for
for j(n, 2 * n - 1)
do rots2[j] :: rots[j - n] + 2.0 * lib@pi
end for
for j(0, n - 1)
var target: float :: rots[j] + lib@pi
var ok: int :: j
var ng: int :: j + n
while((ok - ng).abs() > 1)
var mid: int :: (ok + ng) / 2
if(rots2[mid] <= target)
do ok :: mid
else
do ng :: mid
end if
end while
do ans :: [ans, f(rots2[ok] - rots[j])].max()
do ans :: [ans, f(rots2[ok + 1] - rots[j])].max()
end for
end for
do cui@print("\{lib@toDegree(ans)}\n")
func f(t: float): float
if(t > lib@pi)
do t :: 2.0 * lib@pi - t
end if
ret t
end func
end func
| null |
85 | 010 | #include <iostream>
using namespace std;
// 入力
int N;
int C[100009], P[100009];
int Q;
int L[100009], R[100009];
// 累積和
int Sum1[100009];
int Sum2[100009];
int main() {
// Step #1. 入力
cin >> N;
for (int i = 1; i <= N; i++) cin >> C[i] >> P[i];
cin >> Q;
for (int i = 1; i <= Q; i++) cin >> L[i] >> R[i];
// Step #2. 1 組・2 組それぞれの累積和を取る
for (int i = 1; i <= N; i++) {
Sum1[i] = Sum1[i - 1];
Sum2[i] = Sum2[i - 1];
if (C[i] == 1) Sum1[i] += P[i];
if (C[i] == 2) Sum2[i] += P[i];
}
// Step #3. クエリに答える
for (int i = 1; i <= Q; i++) {
int Answer1 = Sum1[R[i]] - Sum1[L[i] - 1];
int Answer2 = Sum2[R[i]] - Sum2[L[i] - 1];
cout << Answer1 << " " << Answer2 << endl;
}
return 0;
} | n = read_line.to_i
sums = {0, 1}.map { [0] * n.succ }
n.times do |i|
c, p = read_line.split.map(&.to_i)
sums.each { |sum| sum[i + 1] += sum[i] }
sums[c - 1][i + 1] += p
end
read_line.to_i.times do
l, r = read_line.split.map(&.to_i)
puts sums.join(' ') { |sum| sum[r] - sum[l - 1] }
end
| null | null | null | null | null |
86 | 010 | #include <iostream>
using namespace std;
// 入力
int N;
int C[100009], P[100009];
int Q;
int L[100009], R[100009];
// 累積和
int Sum1[100009];
int Sum2[100009];
int main() {
// Step #1. 入力
cin >> N;
for (int i = 1; i <= N; i++) cin >> C[i] >> P[i];
cin >> Q;
for (int i = 1; i <= Q; i++) cin >> L[i] >> R[i];
// Step #2. 1 組・2 組それぞれの累積和を取る
for (int i = 1; i <= N; i++) {
Sum1[i] = Sum1[i - 1];
Sum2[i] = Sum2[i - 1];
if (C[i] == 1) Sum1[i] += P[i];
if (C[i] == 2) Sum2[i] += P[i];
}
// Step #3. クエリに答える
for (int i = 1; i <= Q; i++) {
int Answer1 = Sum1[R[i]] - Sum1[L[i] - 1];
int Answer2 = Sum2[R[i]] - Sum2[L[i] - 1];
cout << Answer1 << " " << Answer2 << endl;
}
return 0;
} | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
N = int(input())
S = [[0] * (N + 1) for _ in range(2)]
for i in range(N):
c, p = map(int, input().split())
S[c - 1][i + 1] = p
for i in range(N):
for j in range(2):
S[j][i + 1] += S[j][i]
Q = int(input())
LR = [tuple(map(int, input().split())) for _ in range(Q)]
for l, r in LR:
print(S[0][r] - S[0][l - 1], S[1][r] - S[1][l - 1])
| null | null | null | null |
87 | 010 | #include <iostream>
using namespace std;
// 入力
int N;
int C[100009], P[100009];
int Q;
int L[100009], R[100009];
// 累積和
int Sum1[100009];
int Sum2[100009];
int main() {
// Step #1. 入力
cin >> N;
for (int i = 1; i <= N; i++) cin >> C[i] >> P[i];
cin >> Q;
for (int i = 1; i <= Q; i++) cin >> L[i] >> R[i];
// Step #2. 1 組・2 組それぞれの累積和を取る
for (int i = 1; i <= N; i++) {
Sum1[i] = Sum1[i - 1];
Sum2[i] = Sum2[i - 1];
if (C[i] == 1) Sum1[i] += P[i];
if (C[i] == 2) Sum2[i] += P[i];
}
// Step #3. クエリに答える
for (int i = 1; i <= Q; i++) {
int Answer1 = Sum1[R[i]] - Sum1[L[i] - 1];
int Answer2 = Sum2[R[i]] - Sum2[L[i] - 1];
cout << Answer1 << " " << Answer2 << endl;
}
return 0;
} | null | null | null | null | func main()
var n: int :: cui@inputInt()
var cum1: []int :: #[n + 1]int
var cum2: []int :: #[n + 1]int
for i(0, n - 1)
var c: int :: cui@inputInt()
var p: int :: cui@inputInt()
do cum1[i + 1] :: cum1[i]
do cum2[i + 1] :: cum2[i]
if(c = 1)
do cum1[i + 1] :+ p
else
do cum2[i + 1] :+ p
end if
end for
var q: int :: cui@inputInt()
for(1, q)
var l: int :: cui@inputInt() - 1
var r: int :: cui@inputInt()
do cui@print("\{cum1[r] - cum1[l]} \{cum2[r] - cum2[l]}\n")
end for
end func
| null |
88 | 010 | null | n = read_line.to_i
sums = {0, 1}.map { [0] * n.succ }
n.times do |i|
c, p = read_line.split.map(&.to_i)
sums.each { |sum| sum[i + 1] += sum[i] }
sums[c - 1][i + 1] += p
end
read_line.to_i.times do
l, r = read_line.split.map(&.to_i)
puts sums.join(' ') { |sum| sum[r] - sum[l - 1] }
end
| # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
N = int(input())
S = [[0] * (N + 1) for _ in range(2)]
for i in range(N):
c, p = map(int, input().split())
S[c - 1][i + 1] = p
for i in range(N):
for j in range(2):
S[j][i + 1] += S[j][i]
Q = int(input())
LR = [tuple(map(int, input().split())) for _ in range(Q)]
for l, r in LR:
print(S[0][r] - S[0][l - 1], S[1][r] - S[1][l - 1])
| null | null | null | null |
89 | 010 | null | n = read_line.to_i
sums = {0, 1}.map { [0] * n.succ }
n.times do |i|
c, p = read_line.split.map(&.to_i)
sums.each { |sum| sum[i + 1] += sum[i] }
sums[c - 1][i + 1] += p
end
read_line.to_i.times do
l, r = read_line.split.map(&.to_i)
puts sums.join(' ') { |sum| sum[r] - sum[l - 1] }
end
| null | null | null | func main()
var n: int :: cui@inputInt()
var cum1: []int :: #[n + 1]int
var cum2: []int :: #[n + 1]int
for i(0, n - 1)
var c: int :: cui@inputInt()
var p: int :: cui@inputInt()
do cum1[i + 1] :: cum1[i]
do cum2[i + 1] :: cum2[i]
if(c = 1)
do cum1[i + 1] :+ p
else
do cum2[i + 1] :+ p
end if
end for
var q: int :: cui@inputInt()
for(1, q)
var l: int :: cui@inputInt() - 1
var r: int :: cui@inputInt()
do cui@print("\{cum1[r] - cum1[l]} \{cum2[r] - cum2[l]}\n")
end for
end func
| null |
90 | 010 | null | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
N = int(input())
S = [[0] * (N + 1) for _ in range(2)]
for i in range(N):
c, p = map(int, input().split())
S[c - 1][i + 1] = p
for i in range(N):
for j in range(2):
S[j][i + 1] += S[j][i]
Q = int(input())
LR = [tuple(map(int, input().split())) for _ in range(Q)]
for l, r in LR:
print(S[0][r] - S[0][l - 1], S[1][r] - S[1][l - 1])
| null | null | func main()
var n: int :: cui@inputInt()
var cum1: []int :: #[n + 1]int
var cum2: []int :: #[n + 1]int
for i(0, n - 1)
var c: int :: cui@inputInt()
var p: int :: cui@inputInt()
do cum1[i + 1] :: cum1[i]
do cum2[i + 1] :: cum2[i]
if(c = 1)
do cum1[i + 1] :+ p
else
do cum2[i + 1] :+ p
end if
end for
var q: int :: cui@inputInt()
for(1, q)
var l: int :: cui@inputInt() - 1
var r: int :: cui@inputInt()
do cui@print("\{cum1[r] - cum1[l]} \{cum2[r] - cum2[l]}\n")
end for
end func
| null |
91 | 011 | #include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>
using ll = long long;
using namespace std;
template<class T, class U>
T &chmax(T &a, const U &b){ if(a < b) a = b; return a; }
//43[ms]
int main(){
int n;
cin >> n;
vector<tuple<int,int,int>> v(n);
for(int i = 0; i < n; i++){
int d,c,s;
cin >> d >> c >> s;
v[i] = {d,c,s};
}
sort(v.begin(), v.end());
vector<ll> cur(5001), next(5001);
for(int i = 0; i < n; i++){
int d,c,s;
tie(d,c,s) = v[i];
for(int j = 0; j <= 5000; j++){
next[j] = cur[j];
if(j > d || j < c) continue;
chmax(next[j], cur[j - c] + s);
}
swap(cur, next);
}
ll ans = 0;
for(int i = 0; i <= 5000; i++) chmax(ans, cur[i]);
cout << ans << "\n";
} | n = read_line.to_i
dcs = (1..n).map {
read_line.split.try { |(d, c, s)| {d.to_i, c.to_i, s.to_i64} }
}.sort
day = dcs.max_of { |(d, c, s)| d }
puts dcs.each_with_object([0i64] * day.succ) { |(d, c, s), dp|
(c..d).reverse_each do |i|
dp[i] = {dp[i], dp[i - c] + s}.max
end
(0...day).each do |i|
dp[i + 1] = {dp[i + 1], dp[i]}.max
end
}.max
| null | null | null | null | null |
92 | 011 | #include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>
using ll = long long;
using namespace std;
template<class T, class U>
T &chmax(T &a, const U &b){ if(a < b) a = b; return a; }
//43[ms]
int main(){
int n;
cin >> n;
vector<tuple<int,int,int>> v(n);
for(int i = 0; i < n; i++){
int d,c,s;
cin >> d >> c >> s;
v[i] = {d,c,s};
}
sort(v.begin(), v.end());
vector<ll> cur(5001), next(5001);
for(int i = 0; i < n; i++){
int d,c,s;
tie(d,c,s) = v[i];
for(int j = 0; j <= 5000; j++){
next[j] = cur[j];
if(j > d || j < c) continue;
chmax(next[j], cur[j - c] + s);
}
swap(cur, next);
}
ll ans = 0;
for(int i = 0; i <= 5000; i++) chmax(ans, cur[i]);
cout << ans << "\n";
} | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main():
input = sys.stdin.readline
N = int(input())
DCS = sorted([tuple(map(int, input().split())) for _ in range(N)], key=lambda x: x[0])
M = max(d for d, c, s in DCS)
dp = [[0] * (M + 1) for _ in range(N + 1)]
for i in range(N):
d, c, s = DCS[i]
for j in range(M + 1):
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
if j + c > d: continue
dp[i + 1][j + c] = max(dp[i + 1][j + c], dp[i][j] + s)
print(max(dp[N]))
if __name__ == '__main__':
main()
| null | null | null | null |
93 | 011 | #include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>
using ll = long long;
using namespace std;
template<class T, class U>
T &chmax(T &a, const U &b){ if(a < b) a = b; return a; }
//43[ms]
int main(){
int n;
cin >> n;
vector<tuple<int,int,int>> v(n);
for(int i = 0; i < n; i++){
int d,c,s;
cin >> d >> c >> s;
v[i] = {d,c,s};
}
sort(v.begin(), v.end());
vector<ll> cur(5001), next(5001);
for(int i = 0; i < n; i++){
int d,c,s;
tie(d,c,s) = v[i];
for(int j = 0; j <= 5000; j++){
next[j] = cur[j];
if(j > d || j < c) continue;
chmax(next[j], cur[j - c] + s);
}
swap(cur, next);
}
ll ans = 0;
for(int i = 0; i <= 5000; i++) chmax(ans, cur[i]);
cout << ans << "\n";
} | null | null | null | null | null | null |
94 | 011 | #include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>
using ll = long long;
using namespace std;
template<class T, class U>
T &chmax(T &a, const U &b){ if(a < b) a = b; return a; }
//43[ms]
int main(){
int n;
cin >> n;
vector<tuple<int,int,int>> v(n);
for(int i = 0; i < n; i++){
int d,c,s;
cin >> d >> c >> s;
v[i] = {d,c,s};
}
sort(v.begin(), v.end());
vector<ll> cur(5001), next(5001);
for(int i = 0; i < n; i++){
int d,c,s;
tie(d,c,s) = v[i];
for(int j = 0; j <= 5000; j++){
next[j] = cur[j];
if(j > d || j < c) continue;
chmax(next[j], cur[j - c] + s);
}
swap(cur, next);
}
ll ans = 0;
for(int i = 0; i <= 5000; i++) chmax(ans, cur[i]);
cout << ans << "\n";
} | null | null | null | null | func main()
var n: int :: cui@inputInt()
var works: []Work :: #[n]Work
var dMax: int :: 0
for i(0, n - 1)
var d: int :: cui@inputInt()
var c: int :: cui@inputInt()
var s: int :: cui@inputInt()
do works[i] :: (#Work).init(d, c, s)
do dMax :: [dMax, d].max()
end for
do works.sort()
; dp[仕事番号][合計仕事時間] = 合計金額
var dp: [][]int :: #[n + 1, dMax + 1]int
; 初期化する代わりに、最初の所持金を1円として「最終的な金額 - 1」を答えとする。
do dp[0][0] :: 1
for i(0, n - 1)
for j(0, dMax)
var d: int :: works[i].d
var c: int :: works[i].c
var s: int :: works[i].s
if(j + c <= d)
do dp[i + 1][j + c] :: [dp[i + 1][j + c], dp[i][j] + s].max()
end if
do dp[i + 1][j] :: [dp[i + 1][j], dp[i][j]].max()
end for
end for
var ans: int :: 0
for j(0, dMax)
do ans :: [ans, dp[n][j]].max()
end for
do ans :- 1
do cui@print("\{ans}\n")
class Work()
+var d: int
+var c: int
+var s: int
+func init(d: int, c: int, s: int): Work
do me.d :: d
do me.c :: c
do me.s :: s
ret me
end func
+*func cmp(t: kuin@Class): int
if(me.d < (t $ Work).d)
ret - 1
elif(me.d > (t $ Work).d)
ret 1
end if
ret 0
end func
end class
end func
| null |
95 | 011 | null | n = read_line.to_i
dcs = (1..n).map {
read_line.split.try { |(d, c, s)| {d.to_i, c.to_i, s.to_i64} }
}.sort
day = dcs.max_of { |(d, c, s)| d }
puts dcs.each_with_object([0i64] * day.succ) { |(d, c, s), dp|
(c..d).reverse_each do |i|
dp[i] = {dp[i], dp[i - c] + s}.max
end
(0...day).each do |i|
dp[i + 1] = {dp[i + 1], dp[i]}.max
end
}.max
| # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main():
input = sys.stdin.readline
N = int(input())
DCS = sorted([tuple(map(int, input().split())) for _ in range(N)], key=lambda x: x[0])
M = max(d for d, c, s in DCS)
dp = [[0] * (M + 1) for _ in range(N + 1)]
for i in range(N):
d, c, s = DCS[i]
for j in range(M + 1):
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
if j + c > d: continue
dp[i + 1][j + c] = max(dp[i + 1][j + c], dp[i][j] + s)
print(max(dp[N]))
if __name__ == '__main__':
main()
| null | null | null | null |
96 | 011 | null | n = read_line.to_i
dcs = (1..n).map {
read_line.split.try { |(d, c, s)| {d.to_i, c.to_i, s.to_i64} }
}.sort
day = dcs.max_of { |(d, c, s)| d }
puts dcs.each_with_object([0i64] * day.succ) { |(d, c, s), dp|
(c..d).reverse_each do |i|
dp[i] = {dp[i], dp[i - c] + s}.max
end
(0...day).each do |i|
dp[i + 1] = {dp[i + 1], dp[i]}.max
end
}.max
| null | null | null | null | null |
97 | 011 | null | n = read_line.to_i
dcs = (1..n).map {
read_line.split.try { |(d, c, s)| {d.to_i, c.to_i, s.to_i64} }
}.sort
day = dcs.max_of { |(d, c, s)| d }
puts dcs.each_with_object([0i64] * day.succ) { |(d, c, s), dp|
(c..d).reverse_each do |i|
dp[i] = {dp[i], dp[i - c] + s}.max
end
(0...day).each do |i|
dp[i + 1] = {dp[i + 1], dp[i]}.max
end
}.max
| null | null | null | func main()
var n: int :: cui@inputInt()
var works: []Work :: #[n]Work
var dMax: int :: 0
for i(0, n - 1)
var d: int :: cui@inputInt()
var c: int :: cui@inputInt()
var s: int :: cui@inputInt()
do works[i] :: (#Work).init(d, c, s)
do dMax :: [dMax, d].max()
end for
do works.sort()
; dp[仕事番号][合計仕事時間] = 合計金額
var dp: [][]int :: #[n + 1, dMax + 1]int
; 初期化する代わりに、最初の所持金を1円として「最終的な金額 - 1」を答えとする。
do dp[0][0] :: 1
for i(0, n - 1)
for j(0, dMax)
var d: int :: works[i].d
var c: int :: works[i].c
var s: int :: works[i].s
if(j + c <= d)
do dp[i + 1][j + c] :: [dp[i + 1][j + c], dp[i][j] + s].max()
end if
do dp[i + 1][j] :: [dp[i + 1][j], dp[i][j]].max()
end for
end for
var ans: int :: 0
for j(0, dMax)
do ans :: [ans, dp[n][j]].max()
end for
do ans :- 1
do cui@print("\{ans}\n")
class Work()
+var d: int
+var c: int
+var s: int
+func init(d: int, c: int, s: int): Work
do me.d :: d
do me.c :: c
do me.s :: s
ret me
end func
+*func cmp(t: kuin@Class): int
if(me.d < (t $ Work).d)
ret - 1
elif(me.d > (t $ Work).d)
ret 1
end if
ret 0
end func
end class
end func
| null |
98 | 011 | null | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main():
input = sys.stdin.readline
N = int(input())
DCS = sorted([tuple(map(int, input().split())) for _ in range(N)], key=lambda x: x[0])
M = max(d for d, c, s in DCS)
dp = [[0] * (M + 1) for _ in range(N + 1)]
for i in range(N):
d, c, s = DCS[i]
for j in range(M + 1):
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
if j + c > d: continue
dp[i + 1][j + c] = max(dp[i + 1][j + c], dp[i][j] + s)
print(max(dp[N]))
if __name__ == '__main__':
main()
| null | null | null | null |
99 | 011 | null | null | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main():
input = sys.stdin.readline
N = int(input())
DCS = sorted([tuple(map(int, input().split())) for _ in range(N)], key=lambda x: x[0])
M = max(d for d, c, s in DCS)
dp = [[0] * (M + 1) for _ in range(N + 1)]
for i in range(N):
d, c, s = DCS[i]
for j in range(M + 1):
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
if j + c > d: continue
dp[i + 1][j + c] = max(dp[i + 1][j + c], dp[i][j] + s)
print(max(dp[N]))
if __name__ == '__main__':
main()
| null | null | func main()
var n: int :: cui@inputInt()
var works: []Work :: #[n]Work
var dMax: int :: 0
for i(0, n - 1)
var d: int :: cui@inputInt()
var c: int :: cui@inputInt()
var s: int :: cui@inputInt()
do works[i] :: (#Work).init(d, c, s)
do dMax :: [dMax, d].max()
end for
do works.sort()
; dp[仕事番号][合計仕事時間] = 合計金額
var dp: [][]int :: #[n + 1, dMax + 1]int
; 初期化する代わりに、最初の所持金を1円として「最終的な金額 - 1」を答えとする。
do dp[0][0] :: 1
for i(0, n - 1)
for j(0, dMax)
var d: int :: works[i].d
var c: int :: works[i].c
var s: int :: works[i].s
if(j + c <= d)
do dp[i + 1][j + c] :: [dp[i + 1][j + c], dp[i][j] + s].max()
end if
do dp[i + 1][j] :: [dp[i + 1][j], dp[i][j]].max()
end for
end for
var ans: int :: 0
for j(0, dMax)
do ans :: [ans, dp[n][j]].max()
end for
do ans :- 1
do cui@print("\{ans}\n")
class Work()
+var d: int
+var c: int
+var s: int
+func init(d: int, c: int, s: int): Work
do me.d :: d
do me.c :: c
do me.s :: s
ret me
end func
+*func cmp(t: kuin@Class): int
if(me.d < (t $ Work).d)
ret - 1
elif(me.d > (t $ Work).d)
ret 1
end if
ret 0
end func
end class
end func
| null |
100 | 011 | null | null | null | null | null | func main()
var n: int :: cui@inputInt()
var works: []Work :: #[n]Work
var dMax: int :: 0
for i(0, n - 1)
var d: int :: cui@inputInt()
var c: int :: cui@inputInt()
var s: int :: cui@inputInt()
do works[i] :: (#Work).init(d, c, s)
do dMax :: [dMax, d].max()
end for
do works.sort()
; dp[仕事番号][合計仕事時間] = 合計金額
var dp: [][]int :: #[n + 1, dMax + 1]int
; 初期化する代わりに、最初の所持金を1円として「最終的な金額 - 1」を答えとする。
do dp[0][0] :: 1
for i(0, n - 1)
for j(0, dMax)
var d: int :: works[i].d
var c: int :: works[i].c
var s: int :: works[i].s
if(j + c <= d)
do dp[i + 1][j + c] :: [dp[i + 1][j + c], dp[i][j] + s].max()
end if
do dp[i + 1][j] :: [dp[i + 1][j], dp[i][j]].max()
end for
end for
var ans: int :: 0
for j(0, dMax)
do ans :: [ans, dp[n][j]].max()
end for
do ans :- 1
do cui@print("\{ans}\n")
class Work()
+var d: int
+var c: int
+var s: int
+func init(d: int, c: int, s: int): Work
do me.d :: d
do me.c :: c
do me.s :: s
ret me
end func
+*func cmp(t: kuin@Class): int
if(me.d < (t $ Work).d)
ret - 1
elif(me.d > (t $ Work).d)
ret 1
end if
ret 0
end func
end class
end func
| null |
End of preview.
README.md exists but content is empty.
- Downloads last month
- 24