| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 96718 |
2019-02-11T12:23:22 Z |
BorisBarca |
Ispit (COCI19_ispit) |
C++14 |
|
531 ms |
30968 KB |
/*
$$$$$$$\ $$\ $$$$$$$\
$$ __$$\ \__| $$ __$$\
$$ | $$ | $$$$$$\ $$$$$$\ $$\ $$$$$$$\ $$ | $$ | $$$$$$\ $$$$$$\ $$$$$$$\ $$$$$$\
$$$$$$$\ |$$ __$$\ $$ __$$\ $$ |$$ _____|$$$$$$$\ | \____$$\ $$ __$$\ $$ _____|\____$$\
$$ __$$\ $$ / $$ |$$ | \__|$$ |\$$$$$$\ $$ __$$\ $$$$$$$ |$$ | \__|$$ / $$$$$$$ |
$$ | $$ |$$ | $$ |$$ | $$ | \____$$\ $$ | $$ |$$ __$$ |$$ | $$ | $$ __$$ |
$$$$$$$ |\$$$$$$ |$$ | $$ |$$$$$$$ |$$$$$$$ |\$$$$$$$ |$$ | \$$$$$$$\\$$$$$$$ |
\_______/ \______/ \__| \__|\_______/ \_______/ \_______|\__| \_______|\_______|
*/
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define INS insert
#define LB lower_bound
#define UB upper_bound
#define pii pair <int,int>
#define pll pair <long long, long long>
#define si pair<string, int>
#define is pair<int, string>
#define X first
#define Y second
#define _ << " " <<
#define sz(x) (int)x.size()
#define all(a) (a).begin(),(a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for (int i = (a); i > (b); --i)
#define FORR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FORP(i, a, b) for ((i) = (a); (i) < (b); ++i)
#define FORA(i, x) for (auto &i : x)
#define REP(i, n) FOR(i, 0, n)
#define BITS(x) __builtin_popcount(x)
#define MSET memset
#define MCPY memcpy
#define SQ(a) (a) * (a)
typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <ll> vll;
typedef vector <pll> vpl;
typedef vector <double> vd;
typedef vector <ld> vld;
typedef vector<si> vsi;
typedef vector<is> vis;
typedef vector<string> vs;
//((float) t)/CLOCKS_PER_SEC
const int MOD = 1e9 + 7;
const int PI = acos(-1);
const int LOG = 32;
const int INF = 1e9 + 10;
const ll INFL = 1e18 + 10;
const int ABC = 30;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dox[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int doy[] = {0, 0, -1, 1, -1, 1, -1, 1};
inline int sum(int a, int b){
if (a + b >= MOD)
return a + b - MOD;
if (a + b < 0)
return a + b + MOD;
return a + b;
}
inline void add(int &a, int b){
a = sum(a, b);
}
inline int mul(int a, int b){
return (ll)a * (ll)b % MOD;
}
inline int sub(int a, int b){
return (a - b + MOD) % MOD;
}
inline ll pot(ll pot, int n){
ll ret = 1;
while (n){
if (n & 1)
ret = (ret * pot) % MOD;
pot = (pot * pot) % MOD;
n >>= 1;
}
return ret;
}
inline int divide(int a, int b){
return mul(a, pot(b, MOD - 2));
}
ll lcm(ll a, ll b){
return abs(a * b) / __gcd(a, b);
}
inline double ccw(pii A, pii B, pii C){
return (A.X * B.Y) - (A.Y * B.X) + (B.X * C.Y) - (B.Y * C.X) + (C.X * A.Y) - (C.Y * A.X);
}
inline int CCW(pii A, pii B, pii C){
double val = ccw(A, B, C);
double eps = max(max(abs(A.X), abs(A.Y)), max(max(abs(B.X), abs(B.Y)), max(abs(C.X), abs(C.Y)))) / 1e9;
if (val <= -eps)
return -1;
if (val >= eps)
return 1;
return 0;
}
void to_upper(string &x){
REP(i, sz(x))
x[i] = toupper(x[i]);
}
void to_lower(string &x){
REP(i, sz(x))
x[i] = tolower(x[i]);
}
string its(ll x){
if (x == 0)
return "0";
string ret = "";
while (x > 0){
ret += (x % 10) + '0';
x /= 10;
}
reverse(all(ret));
return ret;
}
ll sti(string s){
ll ret = 0;
REP(i, sz(s)){
ret *= 10;
ret += (s[i] - '0');
}
return ret;
}
const int N = 505;
int n, k, pref[N][N][30];
string mat[N];
map <pair<string, vi>, int> cnt;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
MSET(pref, 0, sizeof pref);
cin >> n >> k;
REP(i, n){
cin >> mat[i];
REP(j, n){
pref[i][j][mat[i][j] - 'a']++;
if (j)
REP(l, 26)
pref[i][j][l] += pref[i][j - 1][l];
}
REP(l, 26)
pref[i][n][l] += pref[i][n - 1][l];
}
REP(i, n - k + 1){
cnt.clear();
REP(j, n){
string p = "";
REP(l, i)
p += mat[j][l];
FOR(l, i + k, n)
p += mat[j][l];
vi c(30, 0);
REP(l, 26){
c[l] = pref[j][i + k][l];
if (i)
c[l] -= pref[j][i - 1][l];
}
//cout << cnt[{p, c}] << '\n';
if (cnt[{p, c}]){
// FORA(x, cnt){
// //cout << x.X.X << ' ';
// REP(lll, 26){
// if (x.X.Y[lll] > 0){
// cout << x.X.Y[lll] << '\n';
// char c1 = lll + 'a';
// REP(pp, x.X.Y[lll])
// cout << c1;
// }
// }
// cout << '\n';
// }
cout << "DA\n";
return 0;
}
cnt[{p, c}]++;
}
// FORA(x, cnt){
// cout << x.X.X << ' ';
// REP(i, 26){
// if (x.X.Y[i]){
// char c1 = i + 'a';
// REP(pp, x.X.Y[i])
// cout << c1;
// }
// }
// cout << '\n';
// }
}
cout << "NE\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
22 ms |
30328 KB |
Output is correct |
| 2 |
Correct |
21 ms |
30332 KB |
Output is correct |
| 3 |
Correct |
24 ms |
30456 KB |
Output is correct |
| 4 |
Correct |
25 ms |
30328 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
27 ms |
30328 KB |
Output is correct |
| 2 |
Correct |
22 ms |
30328 KB |
Output is correct |
| 3 |
Correct |
29 ms |
30328 KB |
Output is correct |
| 4 |
Correct |
22 ms |
30328 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
30328 KB |
Output is correct |
| 2 |
Correct |
22 ms |
30332 KB |
Output is correct |
| 3 |
Correct |
24 ms |
30308 KB |
Output is correct |
| 4 |
Correct |
27 ms |
30328 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
30428 KB |
Output is correct |
| 2 |
Correct |
30 ms |
30428 KB |
Output is correct |
| 3 |
Correct |
55 ms |
30464 KB |
Output is correct |
| 4 |
Correct |
51 ms |
30456 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
27 ms |
30428 KB |
Output is correct |
| 2 |
Correct |
28 ms |
30456 KB |
Output is correct |
| 3 |
Correct |
41 ms |
30588 KB |
Output is correct |
| 4 |
Correct |
24 ms |
30328 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
30456 KB |
Output is correct |
| 2 |
Correct |
27 ms |
30456 KB |
Output is correct |
| 3 |
Correct |
36 ms |
30344 KB |
Output is correct |
| 4 |
Correct |
27 ms |
30328 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
30328 KB |
Output is correct |
| 2 |
Correct |
22 ms |
30328 KB |
Output is correct |
| 3 |
Correct |
46 ms |
30376 KB |
Output is correct |
| 4 |
Correct |
37 ms |
30328 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
37 ms |
30584 KB |
Output is correct |
| 2 |
Correct |
38 ms |
30712 KB |
Output is correct |
| 3 |
Correct |
60 ms |
30652 KB |
Output is correct |
| 4 |
Correct |
36 ms |
30712 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
33 ms |
30600 KB |
Output is correct |
| 2 |
Correct |
32 ms |
30584 KB |
Output is correct |
| 3 |
Correct |
531 ms |
30912 KB |
Output is correct |
| 4 |
Correct |
163 ms |
30968 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
36 ms |
30668 KB |
Output is correct |
| 2 |
Correct |
40 ms |
30712 KB |
Output is correct |
| 3 |
Correct |
212 ms |
30840 KB |
Output is correct |
| 4 |
Correct |
46 ms |
30840 KB |
Output is correct |
