QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #227038 | #5413. 同构判定鸡 | chenxinyang2006 | 0 | 197ms | 38120kb | C++14 | 1.4kb | 2023-10-26 20:13:57 | 2023-10-26 20:13:57 |
Judging History
answer
#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;
template <class T>
void chkmax(T &x,T y){
if(x < y) x = y;
}
template <class T>
void chkmin(T &x,T y){
if(x > y) x = y;
}
inline int popcnt(int x){
return __builtin_popcount(x);
}
inline int ctz(int x){
return __builtin_ctz(x);
}
/*ll power(ll p,int k = mod - 2){
ll ans = 1;
while(k){
if(k % 2 == 1) ans = ans * p % mod;
p = p * p % mod;
k /= 2;
}
return ans;
}*/
int T,type;
int N,M;
int readtrash(){
int n,m,p,q;
scanf("%d%d",&n,&m);
rep(i,1,m) scanf("%d%d",&p,&q);
return n;
}
vector <pii> ans;
void solve1(int k){
scanf("%d%d",&N,&M);
ans.clear();
rep(u,1,N){
rep(v,u + 1,N) if(u % k != v % k) ans.eb(mkp(u,v));
}
printf("%d %d\n",N,SZ(ans));
for(pii I:ans) printf("%d %d\n",I.first,I.second);
}
int main(){
scanf("%d",&T);
if(type <= 2){
while(T--) solve1(readtrash() - 1);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Runtime Error
input:
10 1 3 3 1 2 1 3 2 3 33 272 3 3 1 2 1 3 2 3 28 196 3 3 1 2 1 3 2 3 92 2116 3 3 1 2 1 3 2 3 29 210 3 3 1 2 1 3 2 3 62 961 3 3 1 2 1 3 2 3 97 2352 3 3 1 2 1 3 2 3 60 900 3 3 1 2 1 3 2 3 70 1225 3 3 1 2 1 3 2 3 67 1122 3 3 1 2 1 3 2 3 67 1122
output:
result:
Test #2:
score: 0
Wrong Answer
time: 197ms
memory: 38120kb
input:
10 2 5 10 1 2 1 3 1 4 1 5 2 3 2 4 2 5 3 4 3 5 4 5 28 293 8 28 1 2 1 3 1 4 1 5 1 6 1 7 1 8 2 3 2 4 2 5 2 6 2 7 2 8 3 4 3 5 3 6 3 7 3 8 4 5 4 6 4 7 4 8 5 6 5 7 5 8 6 7 6 8 7 8 8 26 4 6 1 2 1 3 1 4 2 3 2 4 3 4 82 2240 3 3 1 2 1 3 2 3 46 528 4 6 1 2 1 3 1 4 2 3 2 4 3 4 42 587 9 36 1 2 1 3 1 4 1 5 1 6 1 ...
output:
3 0 5 8 1 2 1 3 1 5 2 3 2 4 3 4 3 5 4 5 8 24 1 2 1 3 1 4 1 6 1 7 1 8 2 3 2 4 2 5 2 7 2 8 3 4 3 5 3 6 3 8 4 5 4 6 4 7 5 6 5 7 5 8 6 7 6 8 7 8 2240 2150400 1 2 1 3 1 4 1 5 1 6 1 7 1 9 1 10 1 11 1 12 1 13 1 14 1 16 1 17 1 18 1 19 1 20 1 21 1 23 1 24 1 25 1 26 1 27 1 28 1 30 1 31 1 32 1 33 1 34 1 35 1 3...
result:
wrong answer Integer parameter [name=m] equals to 0, violates the range [293, 3] (test case 1)
Test #3:
score: 0
Wrong Answer
time: 0ms
memory: 3948kb
input:
10 3 4 4 1 2 2 3 3 4 4 1 387 774 4 4 1 2 2 3 3 4 4 1 668 1336 4 4 1 2 2 3 3 4 4 1 1403 2806 4 4 1 2 2 3 3 4 4 1 1516 3032 4 4 1 2 2 3 3 4 4 1 1601 3202 4 4 1 2 2 3 3 4 4 1 1649 3298 4 4 1 2 2 3 3 4 4 1 1722 3444 4 4 1 2 2 3 3 4 4 1 1854 3708 4 4 1 2 2 3 3 4 4 1 1926 3852 4 4 1 2 2 3 3 4 4 1 1989 3978
output:
1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0
result:
wrong answer Integer parameter [name=m] equals to 0, violates the range [774, 0] (test case 1)
Test #4:
score: 0
Wrong Answer
time: 0ms
memory: 3860kb
input:
10 4 4 4 1 2 2 3 3 4 4 1 169 1014 4 4 1 2 2 3 3 4 4 1 529 5819 4 4 1 2 2 3 3 4 4 1 841 11774 4 4 1 2 2 3 3 4 4 1 961 14415 4 4 1 2 2 3 3 4 4 1 1369 24642 4 4 1 2 2 3 3 4 4 1 1681 33620 4 4 1 2 2 3 3 4 4 1 1849 38829 4 4 1 2 2 3 3 4 4 1 361 3249 4 4 1 2 2 3 3 4 4 1 289 2312 4 4 1 2 2 3 3 4 4 1 9 9
output:
1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0
result:
wrong answer Integer parameter [name=m] equals to 0, violates the range [1014, 0] (test case 1)
Test #5:
score: 0
Wrong Answer
time: 0ms
memory: 3800kb
input:
1 5 4 4 1 2 2 3 3 4 4 1 2850 24300
output:
1 0
result:
wrong answer Integer parameter [name=m] equals to 0, violates the range [24300, 0]
Test #6:
score: 0
Wrong Answer
time: 0ms
memory: 3752kb
input:
1 6 6 9 1 4 1 5 1 6 2 4 2 5 2 6 3 4 3 5 3 6 343 2350
output:
6 14 1 2 1 3 1 4 1 5 2 3 2 4 2 5 2 6 3 4 3 5 3 6 4 5 4 6 5 6
result:
wrong answer Integer parameter [name=m] equals to 14, violates the range [2350, 15]