| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1324799 | comet0 | Sličnost (COI23_slicnost) | C++20 | 1 ms | 332 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> p(n), q(n);
for (int &x : p) cin >> x;
for (int &x : q) cin >> x;
int m = n - k + 1;
int b = -1;
long long w = 0;
vector<char> s(n + 1, 0);
for (int i = 0; i < m; i++) {
for (int t = 0; t < k; t++) s[p[i + t]] = 1;
for (int j = 0; j < m; j++) {
int u = 0;
for (int t = 0; t < k; t++) u += s[q[j + t]];
if (u > b) {
b = u;
w = 1;
} else if (u == b) w++;
}
for (int t = 0; t < k; t++) s[p[i + t]] = 0;
}
cout << b << ' ' << w;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
