QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#426950#4192. Index Caserania__#WA 2ms3880kbC++231.3kb2024-06-01 02:14:522024-06-01 02:14:52

Judging History

你现在查看的是最新测评结果

  • [2024-06-01 02:14:52]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3880kb
  • [2024-06-01 02:14:52]
  • 提交

answer

#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define double long double
#define f first
#define s second
#define pb push_back
#define pp push
#define ceill(x,y) ((x/y)+(x%y!=0)*(x/abs(x)*y/abs(y)<0?0:1))
#define floorr(x,y) ((x/y)+(x%y!=0)*(x/abs(x)*y/abs(y)<0?-1:0))
#define YN(x) cout<<(x?"YES\n":"NO\n");
#define Yn(x) cout<<(x?"Yes\n":"No\n");
#define yn(x) cout<<(x?"yes\n":"no\n");
const int MAAX=1e18;
const int MOD=1e9+7;
const int MAX=1e9;

int n,m,f[11][11][11],arr[210],a0,a1,dp[210][11][11];
bool fun(int idx,int prev,int prev2){
	if(idx==n)
		return f[prev][a0][a1]==arr[0]&&f[prev2][prev][a0]==arr[n-1];
	int &ret=dp[idx][prev][prev2];
	if(~ret)
		return ret;
	ret=0;
	for(int i=1;i<=m;i++){
		if(f[prev2][prev][i]!=arr[idx-1])
			continue;
		ret|=fun(idx+1,i,prev);
	}
	return ret;
}

in main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int tc=1;
    // cin>>tc;
    while(tc--){
		cin>>n>>m;
		for(int i=1;i<=m;i++){
			for(int j=1;j<=m;j++){
				for(int k=1;k<=m;k++)
					cin>>f[i][j][k];
			}
		}
		for(int i=0;i<n;i++)
			cin>>arr[i];
		bool bol=0;
		for(a0=1;a0<=m;a0++){
			for(a1=1;a1<=m;a1++){
				memset(dp,-1,sizeof dp);
				bol|=fun(2,a0,a1);
			}
		}
		yn(bol)
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3880kb

input:

4 2
1
2
1
2
2
1
2
1
1 2 1 2

output:

yes

result:

ok answer is YES

Test #2:

score: 0
Accepted
time: 1ms
memory: 3804kb

input:

6 2
1
2
1
2
2
1
2
1
1 2 1 2 1 2

output:

no

result:

ok answer is NO

Test #3:

score: 0
Accepted
time: 1ms
memory: 3816kb

input:

10 2
1
2
1
1
2
2
2
2
1 2 2 2 1 2 1 2 1 2

output:

yes

result:

ok answer is YES

Test #4:

score: 0
Accepted
time: 1ms
memory: 3876kb

input:

200 10
1
7
8
5
5
3
7
5
7
4
1
10
10
4
1
2
7
7
9
4
8
7
2
7
7
5
8
6
2
4
4
10
10
10
9
8
6
5
5
8
8
1
1
8
9
5
9
4
6
9
1
6
4
1
1
10
5
2
4
4
3
10
6
9
3
2
4
2
10
10
10
6
8
4
10
9
8
7
2
9
3
7
4
8
6
3
9
9
1
3
10
2
6
10
1
1
3
3
2
1
5
9
9
10
7
8
5
5
10
1
5
8
7
2
9
8
7
1
8
6
7
8
7
2
10
1
1
1
2
7
7
9
9
9
7
5
4
3
4...

output:

no

result:

ok answer is NO

Test #5:

score: 0
Accepted
time: 1ms
memory: 3856kb

input:

200 10
10
8
1
1
8
3
5
6
5
2
8
7
9
10
6
5
5
2
7
6
8
2
1
7
5
2
10
1
2
9
9
3
4
2
9
8
1
10
3
5
2
8
9
5
3
4
2
1
10
2
3
6
6
8
3
8
4
1
4
1
6
9
4
10
1
7
8
3
4
2
10
10
1
2
10
6
10
8
5
6
5
5
10
2
4
5
5
9
10
6
6
10
9
6
8
5
5
10
3
9
1
5
5
2
6
6
8
8
2
4
4
6
1
7
10
3
4
6
10
4
10
7
9
2
10
6
2
10
7
4
6
6
1
7
3
1
9
...

output:

yes

result:

ok answer is YES

Test #6:

score: 0
Accepted
time: 0ms
memory: 3820kb

input:

200 10
9
7
2
9
9
8
5
9
6
6
5
10
4
9
1
2
3
10
1
4
1
5
9
7
8
4
7
9
3
2
8
10
10
1
4
1
4
5
5
10
5
4
8
6
7
10
2
5
3
9
3
1
7
6
9
10
4
2
7
7
9
4
5
8
10
6
3
3
7
7
7
6
1
7
3
3
7
9
10
2
2
8
1
5
9
7
8
3
2
4
4
3
9
2
1
1
10
10
1
10
8
10
5
3
10
3
5
7
1
8
5
10
8
2
8
5
4
1
1
7
6
8
7
7
3
9
4
10
8
1
1
1
10
8
3
6
5
4
...

output:

yes

result:

ok answer is YES

Test #7:

score: -100
Wrong Answer
time: 2ms
memory: 3836kb

input:

200 10
5
4
3
7
5
8
2
9
4
1
3
5
4
9
7
5
1
3
7
10
8
7
5
1
8
2
5
5
9
10
1
5
3
9
2
3
9
5
5
2
1
4
8
5
8
3
8
10
1
1
1
6
4
6
1
2
5
3
3
7
7
8
9
1
3
6
6
7
5
3
6
7
1
1
10
10
5
6
1
10
9
1
10
2
10
1
1
9
7
9
1
6
9
9
3
1
6
2
8
6
3
5
1
2
2
9
6
9
3
7
10
1
3
2
7
7
7
7
3
6
1
10
2
6
6
4
10
4
3
3
1
9
10
7
10
4
6
5
2
8
...

output:

no

result:

wrong answer expected YES, found NO