oj.uz

답안 #421338

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
421338 2021-06-09T04:59:43 Z amunduzbaev Semiexpress (JOI17_semiexpress) C++14
18 / 100
 487 ms 452 KB 
/* made by amunduzbaev */
 
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
 
using namespace std;
//~ using namespace __gnu_pbds;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define mem(arr, v) memset(arr, v, sizeof arr)
#define int long long
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);  
	freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
//~ template<class T> using oset = tree<T, 
//~ null_type, less_equal<T>, rb_tree_tag, 
//~ tree_order_statistics_node_update> ordered_set;
 
const int N = 305;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
 
#define MULTI 0
int n, m, k, q, t, ans, res; //, a[N];
int a, b, c, used[N], dis[N];
vpii edges[N];

void solve(int t_case){
	cin>>n>>m>>k>>a>>b>>c>>t;
	vii tt;
	for(int i=0, x;i<m;i++) cin>>x, tt.pb(x), used[x] = 1;
	for(int i=1;i<n;i++) edges[i].pb({i+1, a});
	for(int i=0;i<m-1;i++) edges[tt[i]].pb({tt[i+1], (tt[i+1] - tt[i]) * b});
	
	for(int i=1;i<=n;i++){
		if(used[i]) continue;
		for(int j=i+1;j<=n;j++){
			if(used[j]) continue; 
			used[i] = used[j] = 2;
			vii tt;
			for(int i=1;i<=n;){
				int j = i;
				while(j <= n && !used[j]) j++;
				if(j > n) break;
				tt.pb(j); i = j + 1;
			} 
			for(int i=0;i<sz(tt)-1;i++) edges[tt[i]].pb({tt[i+1], (tt[i+1] - tt[i]) * c});
			priority_queue<pii> qq;
			qq.push({0, 1}); mem(dis, 127);
			dis[1] = 0;
			while(!qq.empty()){
				auto u = qq.top(); qq.pop();
				if(dis[u.ss] < -u.ff) continue;
				for(auto x : edges[u.ss]){
					if(umin(dis[x.ff], dis[u.ss] + x.ss)) qq.push({dis[x.ff], x.ff});
				}
			} 
			
			int trr = 0;
			for(int i=2;i<=n;i++) if(dis[i] <= t) trr++;
			umax(res, trr);
			//~ cout<<i<<" "<<j<<" "<<trr<<"\n";
			//~ for(int i=1;i<=n;i++) cout<<dis[i]<<" ";
			//~ cout<<"\n";
			for(int i=0;i<sz(tt)-1;i++) edges[tt[i]].pop_back();
			used[i] = used[j] = 0;
		}
	} cout<<res<<"\n";
}

signed main(){
	NeedForSpeed
	if(MULTI){
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	} else solve(1);
	return 0;
}

Compilation message

semiexpress.cpp: In function 'void usaco(std::string)':
semiexpress.cpp:32:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 | void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
semiexpress.cpp:33:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 437 ms 332 KB Output is correct
2 Correct 481 ms 332 KB Output is correct
3 Correct 388 ms 324 KB Output is correct
4 Correct 404 ms 332 KB Output is correct
5 Correct 408 ms 332 KB Output is correct
6 Correct 372 ms 340 KB Output is correct
7 Correct 477 ms 452 KB Output is correct
8 Correct 485 ms 332 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 437 ms 332 KB Output is correct
2 Correct 481 ms 332 KB Output is correct
3 Correct 388 ms 324 KB Output is correct
4 Correct 404 ms 332 KB Output is correct
5 Correct 408 ms 332 KB Output is correct
6 Correct 372 ms 340 KB Output is correct
7 Correct 477 ms 452 KB Output is correct
8 Correct 485 ms 332 KB Output is correct
9 Correct 387 ms 332 KB Output is correct
10 Correct 487 ms 332 KB Output is correct
11 Incorrect 413 ms 332 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 437 ms 332 KB Output is correct
2 Correct 481 ms 332 KB Output is correct
3 Correct 388 ms 324 KB Output is correct
4 Correct 404 ms 332 KB Output is correct
5 Correct 408 ms 332 KB Output is correct
6 Correct 372 ms 340 KB Output is correct
7 Correct 477 ms 452 KB Output is correct
8 Correct 485 ms 332 KB Output is correct
9 Correct 387 ms 332 KB Output is correct
10 Correct 487 ms 332 KB Output is correct
11 Incorrect 413 ms 332 KB Output isn't correct
12 Halted 0 ms 0 KB -