oj.uz

Submission #845767

# Submission time Handle Problem Language Result Execution time Memory
845767 2023-09-06T15:20:33 Z vjudge1 Trener (COCI20_trener) C++
55 / 110
 310 ms 12092 KB 
#include<bits/stdc++.h>
using namespace std;
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	long long a,b,c,d;
	string kel;
	vector < vector <string> > strarr;
	long long arr[55][1505];
	long long mod=1000000007;
	memset(arr,0,sizeof(arr));
	vector <string> den;
	cin>>a>>b;
	for(long long i=0;a>=i;i++){
		strarr.push_back(den);

	}
	for(long long i=0;a>i;i++){
		for(long long j=0;b>j;j++){
			cin>>kel;
			strarr[i].push_back(kel);
		}
	}
	for(long long j=0;b>j;j++){
		arr[a-1][j]=1;
	}
	for(long long i=1;a>=i;i++){
		for(long long j=0;b>j;j++){
			for(long long k=0;b>k;k++){
				long long h=0;
				for(long long ponk = 0;(a-i)>ponk; ponk++){
					if(strarr[a-(i+1)][j][ponk] != strarr[a-(i)][k][ponk]){
						h=1;
						break;
					}
				}
				if(h == 1){
					h=0;
					for(long long ponk = 0;(a-i)>ponk; ponk++){
					if(strarr[a-(i+1)][j][ponk] != strarr[a-(i)][k][ponk+1]){
						h=1;
						break;
					}
					}
					if(h == 0){
						arr[(a-(i+1))][j]=((arr[(a-(i))][k] % mod) + (arr[(a-(i+1))][j] % mod)% mod);
					}

				}
				else{
					arr[(a-(i+1))][j]=((arr[(a-(i))][k] % mod) + (arr[(a-(i+1))][j] % mod)% mod);
				}
			}
		}
	}
	d=0;
	for(long long j=0;b>j;j++){
		d+=arr[0][j];
		d%=mod;
	}
	cout<<d%mod;


	
}

Compilation message

trener.cpp: In function 'int main()':
trener.cpp:6:16: warning: unused variable 'c' [-Wunused-variable]
    6 |  long long a,b,c,d;
      |                ^

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1372 KB Output is correct
2 Correct 3 ms 1372 KB Output is correct
3 Correct 3 ms 1372 KB Output is correct
4 Correct 11 ms 1476 KB Output is correct
5 Correct 8 ms 1372 KB Output is correct
6 Correct 8 ms 1372 KB Output is correct
7 Correct 11 ms 1372 KB Output is correct

Subtask #3
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 3 ms 1372 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 3 ms 1372 KB Output is correct
8 Correct 11 ms 1476 KB Output is correct
9 Correct 8 ms 1372 KB Output is correct
10 Correct 8 ms 1372 KB Output is correct
11 Correct 11 ms 1372 KB Output is correct
12 Runtime error 310 ms 12092 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -