oj.uz

답안 #1032252

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1032252 2024-07-23T13:59:24 Z EkinOnal Job Scheduling (CEOI12_jobs) C++17
0 / 100
 167 ms 35156 KB 
//#pragma GCC optimize("O3,unroll-loops,Ofast")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
using namespace std; using namespace __gnu_pbds;

#define MAX 300007    
#define pb push_back
#define mp make_pair 
#define int long long
#define f first
#define s second
#define vi vector<int>
#define pii pair<int,int>
#define vpii vector<pair<int,int>> 
const int mod = 1e9+7;
const int INF = 1e18;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
// myMap.begin()->first :  key  // myMap.begin()->second : value
int epow(int a,int b){int ans=1;while(b){if(b&1) ans*=a;a*=a;ans%=mod;a%=mod;b>>=1;}return ans%mod;}
int gcd(int a,int b) {if(a<b)swap(a,b);while(b){int tmp=b;b=a%b;a=tmp;}return a;}
int mul(int a,int b){return ((a%mod)*(b%mod)+mod)%mod;}
int sum(int a,int b){return ((a%mod)+(b%mod)+mod)%mod;}

void solve()
{
	int n,d,m; cin >> n >> d >> m;

	vpii v(m);
	for(int i=0;i<m;i++) {cin >> v[i].f;v[i].s=i;}
	sort(v.begin(),v.end());
	
	vi pre(n+5);
	for(int i=0;i<m;i++) pre[v[i].f+d]++;
	for(int i=1;i<=n;i++) pre[i]+=pre[i-1];
	
	int l=1,r=1000000; //önceden 10000 idi!!
	while(l<r){
		int mid=(l+r)>>1;

		bool flag=true;
		for(int i=1;i<=n;i++) if(pre[i]>i*mid) {flag=false;break;}

		if(flag) r=mid;
		else l=mid+1;
	}

	cout << l << endl;
	vector<vi> ans(n+2);
	for(int i=0;i<m;i++) ans[i/l+1].pb(v[i].s+1);
	
	for(int i=1;i<=n;i++)
	{
		for(auto u : ans[i]) cout << u << " ";
		cout << "0 \n";
	//	if(i!=n) cout<<endl;
	}



	
	
}	
 
 
int32_t main() {
//	freopen("island.in", "r", stdin);
//	freopen("island.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(0);   

    int t=1;
//    cin >> t;
    while (t--) solve();
 
    return 0;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 3928 KB Output isn't correct
2 Incorrect 12 ms 3928 KB Output isn't correct
3 Incorrect 12 ms 3928 KB Output isn't correct
4 Incorrect 12 ms 3984 KB Output isn't correct
5 Incorrect 12 ms 3932 KB Output isn't correct
6 Incorrect 12 ms 4188 KB Output isn't correct
7 Incorrect 13 ms 4188 KB Output isn't correct
8 Incorrect 14 ms 4188 KB Output isn't correct
9 Incorrect 24 ms 7108 KB Expected EOLN
10 Incorrect 22 ms 7004 KB Expected EOLN
11 Incorrect 23 ms 3932 KB Expected EOLN
12 Incorrect 38 ms 7544 KB Expected EOLN
13 Incorrect 52 ms 12112 KB Expected EOLN
14 Incorrect 82 ms 16916 KB Expected EOLN
15 Incorrect 94 ms 17488 KB Output isn't correct
16 Incorrect 117 ms 21844 KB Expected EOLN
17 Incorrect 134 ms 29524 KB Expected EOLN
18 Incorrect 152 ms 29316 KB Expected EOLN
19 Runtime error 167 ms 35156 KB Memory limit exceeded
20 Incorrect 139 ms 29580 KB Expected EOLN