oj.uz

답안 #724105

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
724105 2023-04-14T17:46:55 Z vjudge1 메기 농장 (IOI22_fish) C++17
12 / 100
 114 ms 25788 KB 
#include<bits/stdc++.h>
#define ll long long 
#define ld long double
#define db double
#define ull unsigned long long
#define pb push_back
#define inf 1000000000000000000
#define linf 1000000000
#define mpr make_pair
#define in insert
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
//author :: E.Mustafayev 
using namespace std;


const int Max= 100000;

vector<vector<vector<ll>>> dp(Max,vector<vector<ll>>(2,vector<ll>(2)));
vector<int>v(Max);
int N;

ll solve(int col, bool a, bool b) {
  if (col==N) {
    return 0;
  }
ll &res=dp[col][a][b];
  if (res!=-1) {
    return res;
  }


  res=solve(col+1,b,false);

ll x=0;
  if (col>0&& b){
  x-=v[col];
  } 
  if (col>0&&!a&&!b){
   x+=v[col-1];
}
  if (col+1<N){
  x+=v[col+1];
 }
  res=max(res,x+solve(col+1,b,true));

  return res;
}

ll max_weights(int n, int m, vector<int>x, vector<int>y, vector<int>w) {

for(int i=0;i<m;i++){

    v[x[i]]=w[i];
}
for(int i=0;i<Max;i++){
	for(int j=0;j<2;j++){
	for(int k=0;k<2;k++){
	dp[i][j][k]=-1;
	}
	}

}
bool a=true,b=true;
N=n;
ll ans=0;
for(int i=0;i<m;i++){
	if(x[i]%2){
	a=false;
	}
ans+=w[i];
}
if(a){
return ans;
}


ll res=solve(0,false,false);
  return res;
}

// void solve(){
//int n,m;
//cin>>n>>m;
//vector<int>x(m),y(m),w(m);
//for(int i=0;i<m;i++){
//	cin>>x[i]>>y[i]>>w[i];
//	
//}
//cout<<max_weights(n,m,x,y,w);
//
//
//}
//int main(){
//	ios_base::sync_with_stdio(false);
//
//solve();
//
//}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:66:13: warning: unused variable 'b' [-Wunused-variable]
   66 | bool a=true,b=true;
      |             ^

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 17396 KB Output is correct
2 Correct 46 ms 17880 KB Output is correct
3 Correct 18 ms 15452 KB Output is correct
4 Correct 21 ms 15532 KB Output is correct
5 Correct 104 ms 22528 KB Output is correct
6 Correct 114 ms 22544 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 15456 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 20 ms 15512 KB Output is correct
2 Correct 29 ms 23312 KB Output is correct
3 Correct 46 ms 23856 KB Output is correct
4 Correct 41 ms 24192 KB Output is correct
5 Correct 58 ms 25640 KB Output is correct
6 Correct 57 ms 25788 KB Output is correct
7 Correct 50 ms 25688 KB Output is correct
8 Correct 55 ms 25712 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 15500 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 18 ms 15500 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 18 ms 15500 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 20 ms 15512 KB Output is correct
2 Correct 29 ms 23312 KB Output is correct
3 Correct 46 ms 23856 KB Output is correct
4 Correct 41 ms 24192 KB Output is correct
5 Correct 58 ms 25640 KB Output is correct
6 Correct 57 ms 25788 KB Output is correct
7 Correct 50 ms 25688 KB Output is correct
8 Correct 55 ms 25712 KB Output is correct
9 Incorrect 60 ms 25732 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 Correct 39 ms 17396 KB Output is correct
2 Correct 46 ms 17880 KB Output is correct
3 Correct 18 ms 15452 KB Output is correct
4 Correct 21 ms 15532 KB Output is correct
5 Correct 104 ms 22528 KB Output is correct
6 Correct 114 ms 22544 KB Output is correct
7 Incorrect 18 ms 15456 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
8 Halted 0 ms 0 KB -