QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#190022 | #6319. Parallel Processing (Easy) | 275307894a | WA | 0ms | 4040kb | C++14 | 1.6kb | 2023-09-28 08:14:20 | 2023-09-28 08:14:21 |
Judging History
answer
#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=2e5+5,M=N*100+5,K=600+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
int n;
vector<tuple<int,int,int> > ans;
void Do(int x,int y,int z){ans.emplace_back(x,y,z);}
void Solve(){
int i,j;scanf("%d",&n);
int m=1;
while(m+15<=n){
for(i=m;i<m+3;i++) {
for(j=i;j<m+15;j+=4) Do(j+1,j,j+1);
}
for(i=m+3;i<m+15;i+=4) for(j=i+1;j<=i+4;j++) Do(j,i,j);
m+=15;
}
if(m==n){
}else if(m+1>=n){
Do(m+1,m,m+1);Do(2000,2000,2000);Do(2000,2000,2000);Do(2000,2000,2000);
}else if(m+3>=n){
Do(m+1,m,m+1);Do(m+3,m+2,m+3);Do(2000,2000,2000);Do(2000,2000,2000);
Do(m+2,m+1,m+2);Do(m+3,m+1,m+3);Do(2000,2000,2000);Do(2000,2000,2000);
}else if(m+7>=n){
Do(m+1,m,m+1);Do(m+3,m+2,m+3);Do(m+5,m+4,m+5);Do(m+7,m+6,m+7);
Do(m+2,m+1,m+2);Do(m+3,m+1,m+3);Do(m+6,m+5,m+6);Do(m+7,m+5,m+7);
Do(m+4,m+3,m+4);Do(m+5,m+3,m+5);Do(m+6,m+3,m+6);Do(m+7,m+3,m+7);
}
printf("%d\n",ans.size()/4);
for(auto i:ans){
int x,y,z;tie(x,y,z)=i;
printf("%d %d %d\n",x,y,z);
}
}
int main(){
int t=1;
// scanf("%d",&t);
while(t--) Solve();
cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3896kb
input:
2
output:
1 2 1 2 2000 2000 2000 2000 2000 2000 2000 2000 2000
result:
ok AC
Test #2:
score: 0
Accepted
time: 0ms
memory: 4040kb
input:
4
output:
2 2 1 2 4 3 4 2000 2000 2000 2000 2000 2000 3 2 3 4 2 4 2000 2000 2000 2000 2000 2000
result:
ok AC
Test #3:
score: 0
Accepted
time: 0ms
memory: 3976kb
input:
3
output:
2 2 1 2 4 3 4 2000 2000 2000 2000 2000 2000 3 2 3 4 2 4 2000 2000 2000 2000 2000 2000
result:
ok AC
Test #4:
score: 0
Accepted
time: 0ms
memory: 4036kb
input:
5
output:
3 2 1 2 4 3 4 6 5 6 8 7 8 3 2 3 4 2 4 7 6 7 8 6 8 5 4 5 6 4 6 7 4 7 8 4 8
result:
ok AC
Test #5:
score: 0
Accepted
time: 0ms
memory: 4020kb
input:
6
output:
3 2 1 2 4 3 4 6 5 6 8 7 8 3 2 3 4 2 4 7 6 7 8 6 8 5 4 5 6 4 6 7 4 7 8 4 8
result:
ok AC
Test #6:
score: 0
Accepted
time: 0ms
memory: 4020kb
input:
7
output:
3 2 1 2 4 3 4 6 5 6 8 7 8 3 2 3 4 2 4 7 6 7 8 6 8 5 4 5 6 4 6 7 4 7 8 4 8
result:
ok AC
Test #7:
score: 0
Accepted
time: 0ms
memory: 4020kb
input:
8
output:
3 2 1 2 4 3 4 6 5 6 8 7 8 3 2 3 4 2 4 7 6 7 8 6 8 5 4 5 6 4 6 7 4 7 8 4 8
result:
ok AC
Test #8:
score: -100
Wrong Answer
time: 0ms
memory: 4040kb
input:
9
output:
0
result:
wrong answer A[2] is not (1, …, 2)