oj.uz

답안 #925368

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925368 2024-02-11T13:47:10 Z 8pete8 Brunhilda’s Birthday (BOI13_brunhilda) C++17
77.4603 / 100
 180 ms 79252 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<cassert>
#include<limits.h>
#include<cmath>
#include<set>
#include<numeric> //gcd(a,b)
#include<algorithm>
#include<bitset> 
#include<stack>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define pppiiii pair<pii,pii>
#define ppii pair<int,pii>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
//#define int long long
const int mod=1e9+7,mxn=1e7,lg=30;//inf=1e18,minf=-1e18,Mxn=100000,root=700;
void setIO(string name){		
	ios_base::sync_with_stdio(0); cin.tie(0);		
	freopen((name+".in").c_str(),"r",stdin);		
	freopen((name+".out").c_str(),"w",stdout);	
}	
int n,q;
int ans[mxn+1],mx[mxn+1];
int32_t main(){
	//setIO("redistricting");
	fastio
	cin>>n>>q;
	vector<int>v(n);
	for(int i=0;i<n;i++)cin>>v[i];
	sort(all(v));
	v.erase(unique(all(v)),v.end());
	for(auto i:v)for(int j=i-1;j<=mxn;j+=i)mx[j]=max(mx[j],i-1);
	for(int i=mxn;i>=0;i--)mx[i]=max(mx[i],mx[i+1]-1);
	for(int i=1;i<=mxn;i++){
		if(mx[i]<=0)ans[i]=-1;
		ans[i]=ans[max(0,i-mx[i])];
		if(ans[i]!=-1)ans[i]++;
	}
	while(q--){
		int g;cin>>g;
		if(ans[g]!=-1)cout<<ans[g]<<'\n';
		else cout<<"oo"<<'\n';
	}
}

Compilation message

brunhilda.cpp: In function 'void setIO(std::string)':
brunhilda.cpp:37:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
brunhilda.cpp:38:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 78672 KB Output is correct
2 Correct 60 ms 78672 KB Output is correct
3 Correct 57 ms 78672 KB Output is correct
4 Correct 46 ms 78676 KB Output is correct
5 Correct 53 ms 78676 KB Output is correct
6 Correct 49 ms 78672 KB Output is correct
7 Correct 56 ms 78672 KB Output is correct
8 Correct 59 ms 78676 KB Output is correct
9 Correct 68 ms 78672 KB Output is correct
10 Correct 86 ms 78676 KB Output is correct
11 Correct 71 ms 78672 KB Output is correct
12 Correct 47 ms 78672 KB Output is correct
13 Correct 139 ms 78676 KB Output is correct
14 Correct 136 ms 78576 KB Output is correct
15 Correct 66 ms 78548 KB Output is correct
16 Correct 59 ms 78500 KB Output is correct
17 Correct 59 ms 78540 KB Output is correct
18 Correct 47 ms 78672 KB Output is correct

Subtask #2
18.8888888889 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 78544 KB Output is correct
2 Correct 71 ms 78852 KB Output is correct
3 Correct 165 ms 78932 KB Output is correct
4 Correct 67 ms 78516 KB Output is correct
5 Correct 109 ms 78676 KB Output is correct
6 Correct 57 ms 78704 KB Output is correct
7 Correct 57 ms 78552 KB Output is correct
8 Correct 70 ms 78676 KB Output is correct
9 Correct 131 ms 78932 KB Output is correct
10 Correct 159 ms 78932 KB Output is correct
11 Incorrect 162 ms 78660 KB Output isn't correct
12 Correct 83 ms 78676 KB Output is correct
13 Correct 49 ms 78676 KB Output is correct
14 Correct 68 ms 78680 KB Output is correct
15 Correct 122 ms 78660 KB Output is correct
16 Correct 66 ms 78932 KB Output is correct
17 Correct 133 ms 78500 KB Output is correct
18 Correct 149 ms 78964 KB Output is correct

Subtask #3
38.5714285714 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 78964 KB Output is correct
2 Correct 179 ms 78964 KB Output is correct
3 Correct 172 ms 78948 KB Output is correct
4 Incorrect 111 ms 78752 KB Output isn't correct
5 Incorrect 81 ms 79160 KB Output isn't correct
6 Correct 138 ms 78928 KB Output is correct
7 Correct 128 ms 79148 KB Output is correct
8 Correct 134 ms 78960 KB Output is correct
9 Correct 134 ms 78948 KB Output is correct
10 Correct 110 ms 78784 KB Output is correct
11 Incorrect 86 ms 78760 KB Output isn't correct
12 Correct 126 ms 78764 KB Output is correct
13 Correct 160 ms 78876 KB Output is correct
14 Correct 100 ms 79252 KB Output is correct
15 Incorrect 133 ms 78672 KB Output isn't correct
16 Correct 148 ms 78676 KB Output is correct
17 Correct 126 ms 78676 KB Output is correct
18 Correct 180 ms 78964 KB Output is correct
19 Incorrect 58 ms 78784 KB Output isn't correct
20 Correct 173 ms 78932 KB Output is correct
21 Incorrect 112 ms 79188 KB Output isn't correct
22 Correct 178 ms 79184 KB Output is correct
23 Correct 82 ms 78844 KB Output is correct
24 Correct 72 ms 79096 KB Output is correct
25 Incorrect 121 ms 79024 KB Output isn't correct
26 Incorrect 114 ms 78756 KB Output isn't correct
27 Correct 168 ms 79124 KB Output is correct
28 Incorrect 68 ms 78952 KB Output isn't correct
29 Correct 166 ms 79184 KB Output is correct
30 Correct 175 ms 79184 KB Output is correct
31 Correct 82 ms 78932 KB Output is correct
32 Incorrect 90 ms 78756 KB Output isn't correct
33 Incorrect 65 ms 78756 KB Output isn't correct
34 Correct 126 ms 79152 KB Output is correct
35 Incorrect 70 ms 78780 KB Output isn't correct
36 Correct 177 ms 79104 KB Output is correct
37 Incorrect 87 ms 79188 KB Output isn't correct
38 Correct 152 ms 78932 KB Output is correct
39 Incorrect 78 ms 78928 KB Output isn't correct
40 Correct 129 ms 78868 KB Output is correct
41 Correct 113 ms 79148 KB Output is correct
42 Incorrect 158 ms 79016 KB Output isn't correct