QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#703422#8334. GenexiangjiWA 840ms3556kbC++20777b2024-11-02 17:46:292024-11-02 17:46:31

Judging History

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

  • [2024-11-02 17:46:31]
  • 评测
  • 测评结果:WA
  • 用时:840ms
  • 内存:3556kb
  • [2024-11-02 17:46:29]
  • 提交

answer

 #pragma GCC optimize(2)
// #pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "D:/OneDrive/study/cpp/.vscode/debug.h"
#else
#define debug(...) 42;
#endif
#define int long long
#define endl "\n"
#define ull unsigned long long
#define ll __int128_t
mt19937 rd(chrono::system_clock::now().time_since_epoch().count());
const int mod = 998244353;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int MAXN = 2e5 + 10;
const double eps = 1e-6;

void solve()
{
    int sum = 0;
    for (int i = 1; i <= 6e8; i++)
    {
        sum += rd();
    }
}

signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1;
    // cin>>_;
    while (_--)
        solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 840ms
memory: 3556kb

input:

6 4 4 1
kaki
kika
manu
nana
tepu
tero
kaka
mana
teri
anan

output:


result:

wrong answer Answer contains longer sequence [length = 4], but output contains 0 elements