# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332708 | daniel920712 | Selling RNA Strands (JOI16_selling_rna) | C++14 | 1593 ms | 80580 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 <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <string.h>
#include <map>
using namespace std;
int MOD=1e9+7;
vector < int > a[100005],b[100005];
vector < int > can;
map < pair < int , int > , int > con[65][65];
char tt[100005];
char tt2[100005];
int sz[100005];
int main()
{
int N,M,K,t=0,i,j,k,t2,xx,yy,ans;
scanf("%d %d",&N,&M);
for(i=0;i<N;i++)
{
scanf("%s",tt);
K=(int) strlen(tt);
sz[i]=K;
if(K>50) can.push_back(i);
t=0;
for(j=0;j<K;j++)
{
t=(int) ( ((long long) t)*4%MOD);
Compilation message (stderr)
# | 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... |