QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #426467 | #6320. Parallel Processing (Hard) | Kevin5307 | WA | 1ms | 3560kb | C++23 | 707b | 2024-05-31 12:24:18 | 2024-05-31 12:24:19 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main()
{
int id,n;
cin>>n;
int s=(int)(ceil(0.4*(n-1)));
cout<<s<<endl;
vector<array<int,3>> vec;
auto print=[&](int a,int b,int c)
{
vec.push_back({c,a,b});
};
for(int i=1;i<n;i+=10)
{
print(i,i+1,i+1);
print(i+2,i+3,i+3);
print(i+4,i+5,i+5);
print(i+7,i+8,i+8);
print(i+1,i+2,i+2);
print(i+1,i+3,i+3);
print(i+5,i+6,i+6);
print(i+8,i+9,i+9);
print(i+3,i+4,i+4);
print(i+3,i+5,i+5);
print(i+3,i+6,i+6);
print(i+6,i+7,i+7);
print(i+6,i+8,i+8);
print(i+6,i+9,i+9);
print(i+6,i+10,i+10);
}
for(int i=0;i<s*4;i++)
cout<<vec[i][0]<<" "<<vec[i][1]<<" "<<vec[i][2]<<endl;
return 0;
}
详细
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3560kb
input:
17
output:
7 2 1 2 4 3 4 6 5 6 9 8 9 3 2 3 4 2 4 7 6 7 10 9 10 5 4 5 6 4 6 7 4 7 8 7 8 9 7 9 10 7 10 11 7 11 12 11 12 14 13 14 16 15 16 19 18 19 13 12 13 14 12 14 17 16 17 20 19 20 15 14 15 16 14 16 17 14 17 18 17 18 19 17 19
result:
wrong answer A[8] is not (1, …, 8)