QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#539137	#8934. Challenge NPC	ucup-team037^#	WA	15ms	5244kb	C++20	1.5kb	2024-08-31 14:05:52	2024-08-31 14:05:53

Judging History

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

[2024-08-31 14:05:53]
评测

测评结果：WA
用时：15ms
内存：5244kb

查看

[2024-08-31 14:05:52]
提交

answer


// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return b < a ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

int k;
vii eg;

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> k;
    int n = 1024;
    REP (i, 0, n / 2) {
        RREP (j, i - 1, 0) {
            eg.pb({i * 2 + 1, j * 2 + 2});
            eg.pb({i * 2 + 2, j * 2 + 1});
        }
    }
    cout << n << ' ' << SZ(eg) << ' ' << 2 << '\n';
    REP (i, 1, n + 2) {
        cout << i % 2 + 1 << ' ';
    }
    cout << '\n';
    for (auto [u, v] : eg) {
        cout << u << ' ' << v << '\n';
    }
    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0

Wrong Answer

time: 15ms

memory: 5244kb

input:

output:

1024 261632 2
2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 ...

result:

wrong answer The graph is not correct