QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#754679#9629. 小 C 的神秘图形miaojiachunWA 1ms3980kbC++143.1kb2024-11-16 15:32:462024-11-16 15:32:46

Judging History

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

  • [2024-11-16 15:32:46]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3980kb
  • [2024-11-16 15:32:46]
  • 提交

answer

#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline")
#define endl '\n'
#define int long long
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
#define x first
#define y second
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
typedef pair<double, double> pdd;
int n, m, k;
// int a[N];

string a2[9]={
    "000010000",
    "000111000",
    "000010000",
    "010010010",
    "111111111",
    "010010010",
    "000010000",
    "000111000",
    "000010000"
};

int qmi(int x,int y){
    int res=1;
    while(y){
        if(y&1) res*=x;
        x*=x;
        y>>=1;
    }
    return res;
}

void sovle()
{
    cin>>n;
    string a,b;
    cin>>a>>b;
    // cout<<a<<" "<<b<<endl;
    // cout<<na<<" "<<nb<<endl;
    if(n==1){
        if(a[0]=='1' or b[0]=='1'){
            cout<<1<<endl;
        }else{
            cout<<0<<endl;
        }
        return;
    }
    while(a.size()<2){
        a='0'+a;
    }while(b.size()<2){
        b='0'+b;
    }
    // cout<<a.size()<<" "<<b.size()<<endl;
    int na=a.size(),nb=b.size();
    int n1=0,n2=0,cnt=1;
    for(int i=na-1;i>=na-2;i--) n1+=(a[i]-'0')*cnt,cnt*=3;   
    cnt=1;
    for(int i=nb-1;i>=nb-2;i--) n2+=(b[i]-'0')*cnt,cnt*=3;
    // for(int i=n;i>=3;i--){
    //     n1%=qmi(3,i-1);
    //     n2%=qmi(3,i-1);
    // }
    // cout<<n1<<" "<<n2<<endl;
    // cout<<n1<<" "<<n2<<endl;
    cout<<a2[n1][n2];
}
signed main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
    {
        sovle();
    }
    return 0;
}
/*
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 
0 0 0 1 1 1 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 1 1 1 0 0 0 
0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 
0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 
0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 
0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 
0 0 0 1 1 1 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 1 1 1 0 0 0 
0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 


*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3560kb

input:

96
122100012110202022211102020101110122101010001012220001000222210100222112111020002212000222012022
010112102102202201211121022102211110211010101020001021100101110202100010112221022001101222101102

output:

0

result:

ok single line: '0'

Test #2:

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

input:

100
2101120010010021010112120010111111212001120112101221211001111101012021111111211111110120002210111111
1010111101111111121211011101011101111111011201111110112110001211101110200102102020021011111121221102

output:

1

result:

ok single line: '1'

Test #3:

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

input:

99964
101002101200222202100122011200221000211122121100220122120000211012222202201100020022111022100011102001110202020022221021121112222001000000222111110122022101020102020201020220110010111110212211102001211220111201120022022100121110122112202222122121210221211011100112021210022011100222220001021120...

output:

0

result:

ok single line: '0'

Test #4:

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

input:

99951
210210010000101201101221221111222021121110110111211121000221100101112021101122111212111111221211211111110020101222110220011121002221000101112210111111211101012112001111111022111210112111101222121112021110101121011122120022111101110100010121000001112102211211211110111101122121110011112111220101...

output:

1

result:

ok single line: '1'

Test #5:

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

input:

99943
011221000000210101021220102000020221110121222200111110000002210121002112122010100110200120110110202201201212021102101201112202210100000202011011220010210101201000012222122200021122022222120212112222111122211210120101120200212101022112221210210202202102020110101111010100010011002222212101111112...

output:

0

result:

ok single line: '0'

Test #6:

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

input:

99930
221111110121110102000211111010111112111111021120112221200101010100111001100012111011021221001101112110221111112010110001011112011121021122202012110100112111111121111212011111111121121010101120011101111212002111120110101101010111111110011121011201112112001201211121102112121121200110111010022200...

output:

1

result:

ok single line: '1'

Test #7:

score: -100
Wrong Answer
time: 1ms
memory: 3684kb

input:

99933
211012211021101111200221100201211222210221210010001122002021120120022011002122210200011200020121111200011000212101220112100220222011212212112010001112212100100222201002020022020202111001121011112212220201011110212222202201200010020122202002110011122221202221100200021011202000221020202022001111...

output:

1

result:

wrong answer 1st lines differ - expected: '0', found: '1'