QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#606663 | #8934. Challenge NPC | Kanate# | WA | 1ms | 3720kb | C++14 | 1.0kb | 2024-10-03 11:19:27 | 2024-10-03 11:19:31 |
Judging History
answer
#include<bits/stdc++.h>
// #define int long long
//#define mod 1000000007
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
using namespace std;
template<class T>void chkmax(T &a,T b){a=max(a,b);}
template<class T>void chkmin(T &a,T b){a=min(a,b);}
template<class T>T read(T &x)
{
x=0;T f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+(c^'0');c=getchar();}
return x*=f;
}
template<class T,class ...L>void read(T &x,L &...l){read(x),read(l...);}
template<class T>void write(T x)
{
if(x<0){putchar('-');x=-x;}
if(x>9){write(x/10);}putchar(x%10+'0');
}
template<class T>void write(T x,char c){write(x),putchar(c);}
int k;
vector <pair<int,int>> g;
signed main()
{
read(k);
int n=2*(k+2);
rep(i,1,n)rep(j,i+1,n)if(i%2!=j%2)
g.push_back({i,j});
int c=2;
write(n,' '),write(g.size(),' '),write(c,'\n');
rep(i,1,n)write(i&1?1:2," \n"[i==n]);
for(auto [u,v]:g)
write(u,' '),write(v,'\n');
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3720kb
input:
1
output:
6 9 2 1 2 1 2 1 2 1 2 1 4 1 6 2 3 2 5 3 4 3 6 4 5 5 6
result:
wrong answer The graph is not correct