QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#257593#6418. Ah, It's Yesterday Once MoreGodwangWA 0ms3612kbC++141.9kb2023-11-19 10:49:002023-11-19 10:49:01

Judging History

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

  • [2023-11-19 10:49:01]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3612kb
  • [2023-11-19 10:49:00]
  • 提交

answer

#include <iostream>
using namespace std;
#include <set>
#include <algorithm>
#include <cmath>
#include <map>
#include <cstdio>
#include <string>
#include <cstring>
#include <string.h>
#include <stdlib.h>
#include <iomanip>
#include <fstream>
#include <stdio.h>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#define ll long long
#define pb push_back
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define pii pair<int, int>
#define endl '\n'
const double pai = acos(-1);
ll extend_gcd(ll a, ll b, ll& x, ll& y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    ll d = extend_gcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
}
ll fastpow(ll a, ll n)
{
    ll ans = 1;
    while (n)
    {
        if (n & 1)
            ans = (ans * a);
        a = (a * a);
        n >>= 1;
    }
    return ans;
}
const ll inf=0x3f3f3f3f3f3f3f3fll;
const ll mod = 1e9+7;
const int N = 4e2 + 10, M = 5000 + 10;

int main() 
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    //freopen("ain.txt", "r", stdin);freopen("aout.txt", "w", stdout);
cout<<20<<" "<<20<<endl;
cout<<"11100111110111110111\n";
cout<<"00101011010011010001\n";
cout<<"01100110110110110111\n";
cout<<"11001101101101101101\n";
cout<<"10011011011011011011\n";
cout<<"11110110110110110110\n";
cout<<"00001101101101101101\n";
cout<<"11011011011011011011\n";
cout<<"10110110110110110111\n";
cout<<"11101101101101101101\n";
cout<<"11011011011011011011\n";
cout<<"10110110110110110110\n";
cout<<"11101101101101101101\n";
cout<<"00011011011011011011\n";
cout<<"10110110110110110111\n";
cout<<"11101101101101101101\n";
cout<<"11011011011011011011\n";
cout<<"10110110110110110110\n";
cout<<"11101101101101101101\n";
cout<<"10011111011111011111\n";

}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3612kb

input:



output:

20 20
11100111110111110111
00101011010011010001
01100110110110110111
11001101101101101101
10011011011011011011
11110110110110110110
00001101101101101101
11011011011011011011
10110110110110110111
11101101101101101101
11011011011011011011
10110110110110110110
11101101101101101101
00011011011011011011
...

result:

wrong answer Cycle Detected.