ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#186458 | #3351. 霜冻碎片 | Alan_Zhaoyz | 100 | 8ms | 1416kb | C++11 | 945b | 2023-10-01 08:42:51 | 2023-10-01 12:32:02 |
answer
#include <bits/stdc++.h>
using namespace std;
#define For(Ti,Ta,Tb) for(auto Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(auto Ti=(Ta);Ti>=(Tb);--Ti)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
using ll=long long;
const int N=205;
int n,m,b[N][N],ans;
void work(int i){
if(m%3==0){
for(int j=2;j<=m;j+=3){
ans+=b[i][j];
}
}else if(m%3==1){
ans+=b[i][1]+b[i][m];
for(int j=4;j<=m-2;j+=3){
ans+=b[i][j];
}
}else{
ans+=b[i][1];
for(int j=4;j<=m;j+=3){
ans+=b[i][j];
}
}
}
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
cin>>n>>m;
For(i,1,n){
For(j,1,m){
cin>>b[i][j];
}
}
if(n%3==0){
for(int i=2;i<=n;i+=3){
work(i);
}
}else if(n%3==1){
work(1);
work(n);
for(int i=4;i<=n-2;i+=3){
work(i);
}
}else{
work(1);
for(int i=4;i<=n;i+=3){
work(i);
}
}
cout<<ans<<'\n';
return 0;
}
详细
小提示:点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 0ms
memory: 1252kb
input:
2 10 4 5 4 4 4 4 2 2 1 1 4 5 4 4 4 4 2 2 1 1
output:
11
result:
ok 1 number(s): "11"
Test #2:
score: 10
Accepted
time: 0ms
memory: 1256kb
input:
3 6 2 2 2 3 3 1 3 4 3 5 5 3 2 3 2 4 4 3
output:
9
result:
ok 1 number(s): "9"
Test #3:
score: 10
Accepted
time: 0ms
memory: 1252kb
input:
4 5 3 4 4 4 3 4 6 5 5 3 5 7 6 6 4 3 5 4 4 2
output:
14
result:
ok 1 number(s): "14"
Test #4:
score: 10
Accepted
time: 2ms
memory: 1412kb
input:
191 182 2 2 3 2 2 1 1 1 1 0 2 2 3 1 1 1 3 5 4 3 2 3 2 1 1 2 3 4 3 2 2 3 4 3 2 2 2 4 4 5 5 6 5 3 2 2 ...
output:
17471
result:
ok 1 number(s): "17471"
Test #5:
score: 10
Accepted
time: 2ms
memory: 1412kb
input:
189 187 3 5 5 5 4 4 4 5 5 3 2 2 3 2 1 1 2 4 4 3 2 2 4 4 4 2 3 2 4 3 4 4 4 3 3 4 6 5 5 5 4 4 4 5 5 5 ...
output:
17802
result:
ok 1 number(s): "17802"
Test #6:
score: 10
Accepted
time: 2ms
memory: 1400kb
input:
181 187 1 2 4 4 3 3 4 5 4 3 3 3 4 5 4 2 1 1 2 2 4 4 4 2 2 2 4 4 4 4 4 5 3 2 0 2 3 3 2 1 2 2 2 2 1 3 ...
output:
16786
result:
ok 1 number(s): "16786"
Test #7:
score: 10
Accepted
time: 0ms
memory: 1416kb
input:
200 197 4 5 3 2 2 3 3 3 4 4 4 3 4 5 5 4 3 3 2 2 2 3 3 4 5 5 3 2 2 3 2 2 2 2 2 1 3 2 3 2 3 3 3 2 1 1 ...
output:
19623
result:
ok 1 number(s): "19623"
Test #8:
score: 10
Accepted
time: 0ms
memory: 1416kb
input:
196 184 2 2 2 3 4 4 3 4 4 3 2 2 3 2 1 2 4 4 4 3 4 3 2 1 1 3 4 3 2 3 5 6 5 4 3 3 4 3 3 2 4 4 4 2 2 2 ...
output:
18159
result:
ok 1 number(s): "18159"
Test #9:
score: 10
Accepted
time: 0ms
memory: 1404kb
input:
185 192 4 5 4 2 2 1 3 3 3 2 1 1 1 1 2 3 5 6 6 5 5 5 6 4 2 2 3 5 5 6 5 4 3 3 3 3 3 3 4 3 3 1 2 3 5 4 ...
output:
17796
result:
ok 1 number(s): "17796"
Test #10:
score: 10
Accepted
time: 2ms
memory: 1412kb
input:
192 185 3 3 2 2 4 4 4 3 2 2 2 3 4 3 3 1 1 0 2 3 5 5 4 3 2 4 4 4 3 3 3 4 4 3 2 2 4 4 5 3 3 2 2 2 1 3 ...
output:
17644
result:
ok 1 number(s): "17644"