oj.uz

답안 #1072411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072411 2024-08-23T18:35:06 Z vjudge1 메기 농장 (IOI22_fish) C++17
9 / 100
 23 ms 11472 KB 
#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2")
// #pragma GCC target("popcnt")
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
 
#define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
 
#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)

bool cmin(int &a, int b){if(b<a){a=b;return 1;}return 0;}
bool cmax(int &a, int b){if(b>a){a=b;return 1;}return 0;}
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
ll lcm(ll a, ll b){return (a/gcd(a,b))*b;}
ll gauss(ll n){return (n*(n+1))/2;}
const int N = 1e5 + 7;
// ll dp[N][2], pdp[N];
ll max_weights(int n,int m,vi x,vi y,vi w){
    vll arr(n+4, 0), pdp(n+4, 0); 
    vector<vll> dp(n+4, vll(2, 0));
    fo(i, m) {
        arr[x[i]+2] = w[i];
    }
    // pdp[1] = arr[2];
    fore(i, 2, n+2) {
        dp[i][1] = max(dp[i-1][1], dp[i-2][1] + arr[i-1]);
        if(i-3 >= 1)
            dp[i][1] = max(dp[i][1], pdp[i-3] + arr[i-1]);
        dp[i][0] = pdp[i-1];
        pdp[i] = max(dp[i][1] + arr[i+1], pdp[i-1]);
    }
    return max(dp[n+1][0], dp[n+1][1]);
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 8536 KB 1st lines differ - on the 1st token, expected: '40313272768926', found: '803213453'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7260 KB Output is correct
2 Correct 5 ms 7492 KB Output is correct
3 Correct 16 ms 8028 KB Output is correct
4 Correct 13 ms 8792 KB Output is correct
5 Correct 22 ms 11472 KB Output is correct
6 Correct 19 ms 10584 KB Output is correct
7 Correct 23 ms 11356 KB Output is correct
8 Correct 22 ms 11352 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7260 KB Output is correct
2 Correct 5 ms 7492 KB Output is correct
3 Correct 16 ms 8028 KB Output is correct
4 Correct 13 ms 8792 KB Output is correct
5 Correct 22 ms 11472 KB Output is correct
6 Correct 19 ms 10584 KB Output is correct
7 Correct 23 ms 11356 KB Output is correct
8 Correct 22 ms 11352 KB Output is correct
9 Incorrect 21 ms 11100 KB 1st lines differ - on the 1st token, expected: '99999', found: '66666'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 8536 KB 1st lines differ - on the 1st token, expected: '40313272768926', found: '803213453'
2 Halted 0 ms 0 KB -