oj.uz

답안 #1028899

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1028899 2024-07-20T10:07:13 Z vjudge1 Netrpeljivost (COI23_netrpeljivost) C++17
0 / 100
 16 ms 33372 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define OYY LLONG_MAX
#define mod 998244353
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define lim 2050
#define fi first
#define se second

int n;
int dizi[lim][lim];
int dp[lim][lim];

inline pair<int,int> find(int cur,int x){
	int tut,cev=0;
	for(int i=31;i>=0;i--){
		if((cur&(1ll<<i))!=((cur+1)&(1ll<<i))){
			tut=i;
			cev+=(x&(1ll<<i))?0:(1ll<<i);
			break;
		}
		else cev+=(x&(1ll<<i))?(1ll<<i):0;
	}
	//cout<<cur<<" "<<x<<" "<<tut<<endl;
	return {cev,cev+(1ll<<tut)};
}

inline int f(int sira,int eleman){
	if(sira==n)return 0;
	if(~dp[sira][eleman])return dp[sira][eleman];
	int cev=INT_MAX;
	pair<int,int> ara=find(sira,eleman);
	//cout<<sira<<" "<<eleman<<" "<<ara.fi<<" "<<ara.se<<endl;
	for(int i=ara.fi;i<ara.se;i++){
		cev=min(cev,f(sira+1,i)+dizi[eleman][i]);
	}
	return dp[sira][eleman]=cev;
}

int32_t main(){
	faster
	cin>>n;
	memset(dp,-1,sizeof(dp));
	FOR{
		for(int j=1;j<=n;j++){
			cin>>dizi[i-1][j-1];
		}
	}
	
	int cev=LLONG_MAX;
	
	FOR{
		cev=min(cev,f(0,i-1));
	}
	
	cout<<cev<<'\n';
	
	return 0;
}

Compilation message

Main.cpp: In function 'long long int _Z1fxx.part.0(long long int, long long int)':
Main.cpp:31:22: warning: 'tut' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |  return {cev,cev+(1ll<<tut)};
      |                  ~~~~^~~~~~
Main.cpp:21:6: note: 'tut' was declared here
   21 |  int tut,cev=0;
      |      ^~~
Main.cpp:31:22: warning: 'tut' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |  return {cev,cev+(1ll<<tut)};
      |                  ~~~~^~~~~~
Main.cpp:21:6: note: 'tut' was declared here
   21 |  int tut,cev=0;
      |      ^~~
Main.cpp:31:22: warning: 'tut' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |  return {cev,cev+(1ll<<tut)};
      |                  ~~~~^~~~~~
Main.cpp:21:6: note: 'tut' was declared here
   21 |  int tut,cev=0;
      |      ^~~
Main.cpp:31:22: warning: 'tut' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |  return {cev,cev+(1ll<<tut)};
      |                  ~~~~^~~~~~
Main.cpp:21:6: note: 'tut' was declared here
   21 |  int tut,cev=0;
      |      ^~~
Main.cpp:31:22: warning: 'tut' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |  return {cev,cev+(1ll<<tut)};
      |                  ~~~~^~~~~~
Main.cpp:21:6: note: 'tut' was declared here
   21 |  int tut,cev=0;
      |      ^~~
Main.cpp: In function 'int32_t main()':
Main.cpp:31:22: warning: 'tut' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |  return {cev,cev+(1ll<<tut)};
      |                  ~~~~^~~~~~
Main.cpp:21:6: note: 'tut' was declared here
   21 |  int tut,cev=0;
      |      ^~~
Main.cpp:31:22: warning: 'tut' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |  return {cev,cev+(1ll<<tut)};
      |                  ~~~~^~~~~~
Main.cpp:21:6: note: 'tut' was declared here
   21 |  int tut,cev=0;
      |      ^~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 33372 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 33372 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 33372 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 33372 KB Output isn't correct
2 Halted 0 ms 0 KB -