QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#664825#7157. Bikes vs Carspackmani#0 2ms6364kbC++14732b2024-10-21 22:35:492024-10-21 22:35:50

Judging History

你现在查看的是最新测评结果

  • [2024-10-21 22:35:50]
  • 评测
  • 测评结果:0
  • 用时:2ms
  • 内存:6364kb
  • [2024-10-21 22:35:49]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long int
const int SZ = 505;
int n,width;
int c[SZ][SZ];
int b[SZ][SZ];
int32_t main()
{
	ios_base::sync_with_stdio(false); cin.tie(0);
	//freopen("input.txt","r",stdin);
	//freopen("output.txt","w",stdout);
	cin >> n >> width;
	for(int i=1;i<=n-1;i++)
	{
		for(int j=0;j<i;j++)
		{
			cin >> c[j][i];
		}
	}
	for(int i=1;i<=n-1;i++)
	{
		for(int j=0;j<i;j++)
		{
			cin >> b[j][i];
		}
	}
	if(width<c[0][1] or width<b[0][1])
	{
		cout << "NO";
		return 0;
	}
	cout << 2*(n-1) << '\n';
	for(int i=0;i<n-1;i++)
	{
		cout << i << ' ' << i+1 << ' ' << width-b[0][1] << '\n';
		cout << i << ' ' << i+1 << ' ' << b[0][1] << '\n';
	}
	
}

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: 5760kb

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
0 1 463359
0 1 536641
1 2 463359
1 2 536641
2 3 463359
2 3 536641
3 4 463359
3 4 536641
4 5 463359
4 5 536641
5 6 463359
5 6 536641
6 7 463359
6 7 536641
7 8 463359
7 8 536641
8 9 463359
8 9 536641
9 10 463359
9 10 536641
10 11 463359
10 11 536641
11 12 463359
11 12 536641
12 13 463359
12 13 536641

result:

wrong answer Min Max 1 - 0 not equal aij, is 463359, should be 505815

Subtask #2:

score: 0
Skipped

Dependency #1:

0%

Subtask #3:

score: 0
Wrong Answer

Test #16:

score: 0
Wrong Answer
time: 1ms
memory: 5780kb

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
0 1 463359
0 1 536641
1 2 463359
1 2 536641
2 3 463359
2 3 536641
3 4 463359
3 4 536641
4 5 463359
4 5 536641
5 6 463359
5 6 536641
6 7 463359
6 7 536641
7 8 463359
7 8 536641
8 9 463359
8 9 536641
9 10 463359
9 10 536641
10 11 463359
10 11 536641
11 12 463359
11 12 536641
12 13 463359
12 13 536641

result:

wrong answer Min Max 1 - 0 not equal aij, is 463359, should be 505815

Subtask #4:

score: 0
Wrong Answer

Test #39:

score: 0
Wrong Answer
time: 2ms
memory: 6364kb

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:

324
0 1 1
0 1 0
1 2 1
1 2 0
2 3 1
2 3 0
3 4 1
3 4 0
4 5 1
4 5 0
5 6 1
5 6 0
6 7 1
6 7 0
7 8 1
7 8 0
8 9 1
8 9 0
9 10 1
9 10 0
10 11 1
10 11 0
11 12 1
11 12 0
12 13 1
12 13 0
13 14 1
13 14 0
14 15 1
14 15 0
15 16 1
15 16 0
16 17 1
16 17 0
17 18 1
17 18 0
18 19 1
18 19 0
19 20 1
19 20 0
20 21 1
20 21 ...

result:

wrong answer Min Max 1 - 0 not equal aij, is 0, should be 1

Subtask #5:

score: 0
Skipped

Dependency #2:

0%

Subtask #6:

score: 0
Skipped

Dependency #1:

0%