oj.uz

답안 #15361

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
15361 2015-07-12T06:44:33 Z gs13068 쿼터너리 컴퓨터 (kriii3_Z) C++
31 / 126
 4000 ms 1088 KB 
#include<cstdio>
 
int a[22],n,m;
 
int d[22];
int t[22];
int r[22];
 
int w[444];
int x[444];
int y[444];
int z[444];
 
void dfs(int p)
{
    if(p==n)
    {
        int i;
        for(i=0;i<n;i++)t[i]=d[i];
        for(i=0;i<m;i++)
        {
            if(w[i]==0)t[x[i]]=(t[y[i]]+t[z[i]])%4;
            if(w[i]==1)t[x[i]]=t[y[i]]^t[z[i]];
            if(w[i]==2)t[x[i]]=(t[y[i]]+z[i])%4;
            if(w[i]==3)t[x[i]]=t[y[i]]^z[i];
        }
        for(i=0;i<n;i++)r[i]=(r[i]+t[i])%4;
        return;
    }
    for(d[p]=0;d[p]<4;d[p]++)if(d[p]!=a[p])dfs(p+1);
}
 
int main()
{
    int i;
    scanf("%d%d",&n,&m);
    for(i=0;i<n;i++)scanf("%d",&a[i]);
    for(i=0;i<m;i++)scanf("%d%d%d%d",&w[i],&x[i],&y[i],&z[i]);
    dfs(0);
    for(i=0;i<n;i++)printf("%d ",r[i]);
}

Subtask #1
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct
3 Correct 0 ms 1088 KB Output is correct
4 Correct 0 ms 1088 KB Output is correct
5 Correct 0 ms 1088 KB Output is correct
6 Correct 0 ms 1088 KB Output is correct
7 Correct 0 ms 1088 KB Output is correct
8 Correct 0 ms 1088 KB Output is correct
9 Correct 0 ms 1088 KB Output is correct
10 Correct 0 ms 1088 KB Output is correct
11 Correct 0 ms 1088 KB Output is correct
12 Correct 0 ms 1088 KB Output is correct
13 Correct 0 ms 1088 KB Output is correct
14 Correct 0 ms 1088 KB Output is correct
15 Correct 66 ms 1088 KB Output is correct
16 Correct 68 ms 1088 KB Output is correct
17 Correct 612 ms 1088 KB Output is correct
18 Correct 680 ms 1088 KB Output is correct
19 Correct 606 ms 1088 KB Output is correct
20 Correct 585 ms 1088 KB Output is correct

Subtask #2
0.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1789 ms 1088 KB Output is correct
2 Execution timed out 4000 ms 1084 KB Program timed out
3 Halted 0 ms 0 KB -