# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
13318 | woqja125 | Collider (IZhO11_collider) | C++98 | 94 ms | 10348 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<stdio.h>
#include<vector>
int buk[1010][2100];
int bs[1010];
char in[1000100];
int main()
{
int n, m;
int i, j, k;
int a, b, bn;
scanf("%d%d", &n, &m);
scanf("%s", in);
j=0;
for(i=0; j<n; i++)
{
for(k=j; k<j+1000 && k<n; k++)
{
buk[i][k-j] = in[k]-'x';
bs[i]++;
}
j = k;
}
for(;m--;)
{
scanf("%s", in);
if(in[0] == 'a')
{
scanf("%d%d", &a, &b); a--; b--;
int t;
bn = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |