# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239053 | ne4eHbKa | Mate (COCI18_mate) | C++17 | 1304 ms | 35076 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ft first
#define sd second
const int N = 2020;
const int A = 26;
const int md = 1e9 + 7;
const int Q = 5e5 + 5;
void madd(int &a, int b) {a += b; while(a < 0) a += md; while(a >= md) a -= md;}
int msum(int a, int b) {a += b; while(a < 0) a += md; while(a >= md) a -= md; return a;}
void mmul(int &a, int b) {a = 1ll * a * b % md;}
int mpro(int a, int b) {return 1ll * a * b % md;}
int mpow(int a, int p) {
int ans = 1;
for(int i = 1 << 30; i; i >>= 1) {
mmul(ans, ans);
if(p & i) mmul(ans, a);
}
return ans;
}
int n, q;
string s;
int t[Q];
char x[Q], y[Q];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |