QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #562136 | #8934. Challenge NPC | ucup-team3160# | WA | 16ms | 5184kb | C++14 | 438b | 2024-09-13 15:16:30 | 2024-09-13 15:16:30 |
Judging History
answer
# include <bits/stdc++.h>
using namespace std ;
vector < pair< int , int > > eg ;
const int N= 1024 ;
int main()
{
for ( int i = 1 ; i <= N ; i++)
for ( int j = i +1 ; j <= N ; j+= 2 )
eg.push_back( { i , j } ) ;
printf("%d %d %d\n" , N, eg.size() , 2 ) ;
for ( int i = 1 ; i <= N ; i++ )
printf("%d " , ( i & 1 ) + 1 ) ;
puts("") ;
for ( auto t :eg ) printf("%d %d\n" , t.first , t.second) ;
return 0 ;
}
详细
Test #1:
score: 0
Wrong Answer
time: 16ms
memory: 5184kb
input:
1
output:
1024 262144 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