QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #664391 | #7157. Bikes vs Cars | Warinchai_s# | 0 | 1ms | 3676kb | C++14 | 708b | 2024-10-21 20:25:49 | 2024-10-21 20:25:49 |
answer
#include<bits/stdc++.h>
using namespace std;
int c[505][505];
int b[505][505];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,w;cin>>n>>w;
for(int i=0;i<n;i++){
for(int j=0;j<i;j++){
cin>>c[j][i];
}
}
for(int i=0;i<n;i++){
for(int j=0;j<i;j++){
cin>>b[j][i];
}
}
int rc=c[0][1];
int rb=b[0][1];
assert(rc+rb>=w);
if(rc+rb<w){
cout<<"NO";
return 0;
}
cout<<(n-1)*2<<"\n";
for(int i=0;i<n-1;i++){
cerr<<i<<" "<<i+1<<" "<<rb<<"\n";
cerr<<i<<" "<<i+1<<" "<<w-rc<<"\n";
}
}
/*
4 5
3
3 3
3 3 3
3
3 3
3 3 3
*/
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3600kb
input:
14 1000000 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 49...
output:
26
result:
wrong output format Unexpected end of file - int32 expected
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Wrong Answer
Test #16:
score: 0
Wrong Answer
time: 1ms
memory: 3676kb
input:
14 1000000 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 494185 49...
output:
26
result:
wrong output format Unexpected end of file - int32 expected
Subtask #4:
score: 0
Runtime Error
Test #39:
score: 0
Runtime Error
input:
163 1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 ...
output:
result:
Subtask #5:
score: 0
Skipped
Dependency #2:
0%
Subtask #6:
score: 0
Skipped
Dependency #1:
0%