| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1353687 | sally | Bikes vs Cars (EGOI23_bikesvscars) | C++20 | 2 ms | 836 KiB |
#include<iostream>
#include<vector>
using namespace std;
const int mx = 505;
int N, W;
int C[mx][mx], B[mx][mx];
int main() {
cin>>N>>W;
for(int i=0; i<N; i++)
for(int j=0; j<=i; j++)
cin>>C[i][j];
for(int i=0; i<N; i++)
for(int j=0; j<=i; j++)
cin>>B[i][j];
if(C[0][0] + B[0][0] < W) cout<<"NO";
cout<<(N-1)*2<<'\n';
for(int i=0; i<N-1; i++) cout<<i<<' '<<i+1<<' '<<B[0][0]<<'\n';
for(int i=0; i<N-1; i++) cout<<i<<' '<<i+1<<' '<<W-C[0][0]<<'\n';
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
