QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #580084 | #8934. Challenge NPC | Forever_Young# | WA | 1ms | 3724kb | C++23 | 599b | 2024-09-21 20:01:09 | 2024-09-21 20:01:10 |
Judging History
answer
#include <bits/stdc++.h>
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define stack stck
using namespace std;
#define inf 998244353
#define N 110000
#define M 210000
int main()
{
int k;
cin>>k;
int n=2*k+2;
vector<pair<int,int> > e; e.clear();
for(int i=1;i<=n;i++)
for(int j=1;j<i;j++)
if ((i&1)!=(j&1))e.pb(mp(i,j));
cout<<n<<" "<<e.size()<<" "<<2<<endl;
for(int i=1;i<=n;i++)
if (i&1)printf("1 "); else printf("2 "); puts("");
for(auto p:e)printf("%d %d\n",p.first,p.second);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3724kb
input:
1
output:
4 4 2 1 2 1 2 2 1 3 2 4 1 4 3
result:
wrong answer The graph is not correct