oj.uz

Submission #930994

# Submission time Handle Problem Language Result Execution time Memory
930994 2024-02-21T03:25:44 Z Baizho Job Scheduling (CEOI12_jobs) C++14
60 / 100
 188 ms 13904 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(1e6)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

int n, d, m;
pair<int, int> a[N];

bool check(int mach) {
	int p = 1;
	for(int i = 1; i <= n; i ++) {
		int cnt = 0;
		while(p <= m && cnt < mach && a[p].ff <= i) {
			if(i - a[p].ff > d) return 0;
			p ++;
			cnt ++;
		}
	}
	if(p <= m) return 0;
	return true;
}
 
void Baizho() {
	cin>>n>>d>>m;
	for(int i = 1; i <= m; i ++) {
		cin>>a[i].ff;
		a[i].ss = i;
	}
	sort(a + 1, a + m + 1);
	int l = 1, r = n;
	while(l <= r) {
		int mid = (l + r) / 2;
		if(check(mid)) r = mid - 1;
		else l = mid + 1;
	}
	r ++;
	cout<<r<<"\n";
	int p = 1, mach = r;
	for(int i = 1; i <= n; i ++) {
		int cnt = 0;
		while(p <= m && cnt < mach && a[p].ff <= i) {
			cout<<a[p].ss<<" ";
			p ++;
			cnt ++;
		}
		cout<<"0\n";	
	}
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

jobs.cpp: In function 'void Freopen(std::string)':
jobs.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
jobs.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
60.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 3164 KB Output isn't correct
2 Incorrect 12 ms 3164 KB Output isn't correct
3 Incorrect 12 ms 3164 KB Output isn't correct
4 Incorrect 12 ms 3164 KB Output isn't correct
5 Incorrect 11 ms 3164 KB Output isn't correct
6 Incorrect 17 ms 3164 KB Output isn't correct
7 Incorrect 12 ms 3160 KB Output isn't correct
8 Incorrect 12 ms 3236 KB Output isn't correct
9 Correct 23 ms 3420 KB Output is correct
10 Correct 25 ms 3416 KB Output is correct
11 Correct 19 ms 3164 KB Output is correct
12 Correct 50 ms 3924 KB Output is correct
13 Correct 59 ms 6480 KB Output is correct
14 Correct 85 ms 7252 KB Output is correct
15 Correct 99 ms 8024 KB Output is correct
16 Correct 130 ms 10884 KB Output is correct
17 Correct 145 ms 11600 KB Output is correct
18 Correct 166 ms 12112 KB Output is correct
19 Correct 188 ms 13904 KB Output is correct
20 Correct 166 ms 11600 KB Output is correct