QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#611542	#6418. Ah, It's Yesterday Once More	gates_orz	WA	1ms	3784kb	C++20	3.2kb	2024-10-04 21:23:18	2024-10-04 21:23:18

Judging History

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

[2024-10-04 21:23:18]
评测

测评结果：WA
用时：1ms
内存：3784kb

查看

[2024-10-04 21:23:18]
提交

answer

#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

typedef long long LL;
//#define int LL
#define inl inline
const int N = 3e5 + 10;
const int M = N * 2;
//const int mod=998244353;
const int mod = 1000000007;
const double eps = 1e-8;
//const int mod=1e9+7;
typedef pair<int, int> PII;
//const int INF=0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
int n, m;

void become_faster() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

void solve() {
    vector<string>s(21);
    s[1] ="11110111110011111011";
    s[2] ="01011001011001001101";
    s[3] ="01101101101101100111";
    s[4] ="00110110110110110001";
    s[5] ="00011011011011011001";
    s[6] ="11101101101101101100";
    s[7] ="10110110110110110110";
    s[8] ="11011011011011011011";
    s[9] ="01101101101101101101";
    s[10]="00110110110110110111";
    s[11]="00011011011011011001";
    s[12]="11101101101101101101";
    s[13]="10110110110110110110";
    s[14]="11011011011011011011";
    s[15]="01101101101101101101";
    s[16]="00110110110110110111";
    s[17]="11011011011011011001";
    s[18]="01101101101101101101";
    s[19]="00110110110110110110";
    s[20]="00011100011100011100";
    cout<<"20 20\n";
    for(int i=1;i<=20;i++)cout<<s[i]<<endl;
}

signed main() {
    become_faster();
    int T = 1;
    //T=read();
    //cin>>T;
    //for(int i=1;i<=100;i++)solve(i);
    while (T--) solve();
    return 0;
}
/*
11011011011000111000
01101101110001101100
00110110100011000100
10010101100110001110
11011101001100001000
01100111011000111010
00110001110000100110
01011000100000111100
01101101110011000010
01011011011001110010
01001110001101011011
01111000000111001110
10010000000001000000
10010000000001101100
11011000000010110110
01101100000110011011
00110110001101101101
00011011011010110111
00001101110011010100
00000111011110011100
 */
/*
11000000000111011000
01100000001101101100
00110000011000110110
00011000110010011011
00001101100111001101
11100111001101100111
10110010011000110000
11010111001101101110
01101101101011011010
00111010110110110011
11000010011101100110
01100111001011001100
11001101101101100110
01011000110110110011
01110011011011011001
10100110001101101101
10110011100110110110
11011000101011011010
01101110101101101110
00111011111000111000
 */

/*
11000000011101100000
01100000110110110000
00110001100011011000
00011011011101101100
10001110110110110110
11000001100011011010
01100011011101101110
00110110110110111000
00011101101011000010
00110011001101100011
01101110011000110110
10111000001100011100
10000011100110110100
10001110110011100110
11011011010110100011
01110001101100110001
11000000111001011000
01100011001001001100
00110110001011000110
00011100001110000011
 */
/*
11110111110011111011
01011001011001001101
01101101101101100111
00110110110110110001
00011011011011011001
11101101101101101100
10110110110110110110
11011011011011011011
01101101101101101101
00110110110110110111
00011011011011011001
11101101101101101101
10110110110110110110
11011011011011011011
01101101101101101101
00110110110110110111
11011011011011011001
01101101101101101101
00110110110110110110
00011100011100011100
 */

源文件, 语言: C++20

详细

Test #1:

score: 0

Wrong Answer

time: 1ms

memory: 3784kb

input:

output:

20 20
11110111110011111011
01011001011001001101
01101101101101100111
00110110110110110001
00011011011011011001
11101101101101101100
10110110110110110110
11011011011011011011
01101101101101101101
00110110110110110111
00011011011011011001
11101101101101101101
10110110110110110110
11011011011011011011
...

result:

wrong answer 123 successful hack.