NOI.AC
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #214369 | #2767. 摆烂 | yiwei | 0 | 0ms | 7172kb | C++11 | 695b | 2024-11-18 18:57:49 | 2024-11-19 08:26:41 |
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
int n;
struct Node{
int s,t;
}a[N];
int f[N], g[N][N];
int main(){
cin >> n;
for (int i = 1;i <= n;i++)
cin >> a[i].t >> a[i].s;
for (int i = 1;i <= n;i++){
g[i][i] = a[i].s;
for (int j = i + 1;j <= n;j++)
g[i][j] = max(g[i][j - 1],a[j].s);
}
memset(f,0x3f,sizeof(f));
f[0] = 0;
for (int i = 1;i <= n;i++){
for (int j = 1;j <= i;j++){
f[i] = min(f[i],max(f[j - 1],a[i].t) + g[j][i] * 2);
// cout << j << ' ' << i << ':' << g[j][i] << '\n';
}
}
cout << f[n];
return 0;
}
详细
小提示：点击横条可展开更详细的信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 1296kb
input:
20 12513359 382258501 49946422 294259408 61782741 259996549 128874560 457675284 152578248 511428369 ...
output:
-1776738764
result:
wrong answer 1st numbers differ - expected: '2781551734', found: '-1776738764'
Subtask #2:
score: 0
Wrong Answer
Test #8:
score: 0
Wrong Answer
time: 0ms
memory: 7172kb
input:
1000 132699 718470029 234343 395421925 1290414 393017296 1399642 607415822 1402810 515471990 2008288...
output:
-1447584000
result:
wrong answer 1st numbers differ - expected: '2991845504', found: '-1447584000'
Subtask #3:
score: 0
Runtime Error
Test #20:
score: 0
Runtime Error
input:
100000 9326 430414358 13368 156324232 15149 550951304 22296 345034579 22578 397947033 37137 49312905...
output:
result:
Subtask #4:
score: 0
Runtime Error
Test #32:
score: 0
Runtime Error
input:
2000000 181 24185667 293 532288461 1433 921996635 1694 629544979 2540 173534643 2662 963172401 3159 ...
output:
result:
Subtask #5:
score: 0
Runtime Error
Test #42:
score: 0
Runtime Error
input:
2000000 684 624071334 1181 709831992 1397 43325781 1938 430417709 4157 60566309 4568 912818933 5265 ...
