oj.uz

답안 #925377

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925377 2024-02-11T13:57:01 Z 8pete8 Brunhilda’s Birthday (BOI13_brunhilda) C++17
80.3175 / 100
 200 ms 79440 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+10,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+10],mx[mxn+10];
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++){
		ans[i]=ans[i-mx[i]];
		if(ans[i]!=-1)ans[i]++;
		if(i<v.back())ans[i]=1;
		if(mx[i]<=0)ans[i]=-1;
	}
	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 60 ms 78676 KB Output is correct
2 Correct 62 ms 78496 KB Output is correct
3 Correct 61 ms 78564 KB Output is correct
4 Correct 48 ms 78676 KB Output is correct
5 Correct 57 ms 78676 KB Output is correct
6 Correct 53 ms 78676 KB Output is correct
7 Correct 62 ms 78504 KB Output is correct
8 Correct 64 ms 78652 KB Output is correct
9 Correct 69 ms 78480 KB Output is correct
10 Correct 79 ms 78484 KB Output is correct
11 Correct 73 ms 78672 KB Output is correct
12 Correct 46 ms 78672 KB Output is correct
13 Correct 131 ms 78672 KB Output is correct
14 Correct 132 ms 78672 KB Output is correct
15 Correct 70 ms 78676 KB Output is correct
16 Correct 62 ms 78500 KB Output is correct
17 Correct 61 ms 78676 KB Output is correct
18 Correct 49 ms 78528 KB Output is correct

Subtask #2
18.8888888889 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 78536 KB Output is correct
2 Correct 67 ms 78932 KB Output is correct
3 Correct 167 ms 78776 KB Output is correct
4 Correct 70 ms 78672 KB Output is correct
5 Correct 118 ms 78704 KB Output is correct
6 Correct 59 ms 78672 KB Output is correct
7 Correct 59 ms 78676 KB Output is correct
8 Correct 68 ms 78508 KB Output is correct
9 Correct 134 ms 78932 KB Output is correct
10 Correct 155 ms 78852 KB Output is correct
11 Incorrect 158 ms 78676 KB Output isn't correct
12 Correct 92 ms 78672 KB Output is correct
13 Correct 52 ms 78596 KB Output is correct
14 Correct 71 ms 78672 KB Output is correct
15 Correct 134 ms 79072 KB Output is correct
16 Correct 66 ms 78856 KB Output is correct
17 Correct 139 ms 78764 KB Output is correct
18 Correct 139 ms 78932 KB Output is correct

Subtask #3
41.4285714286 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 78928 KB Output is correct
2 Correct 160 ms 78932 KB Output is correct
3 Correct 197 ms 78948 KB Output is correct
4 Incorrect 109 ms 78760 KB Output isn't correct
5 Incorrect 84 ms 79184 KB Output isn't correct
6 Correct 156 ms 78928 KB Output is correct
7 Correct 116 ms 79180 KB Output is correct
8 Correct 147 ms 78932 KB Output is correct
9 Correct 139 ms 78996 KB Output is correct
10 Correct 111 ms 78772 KB Output is correct
11 Incorrect 93 ms 78676 KB Output isn't correct
12 Correct 134 ms 78772 KB Output is correct
13 Correct 166 ms 78880 KB Output is correct
14 Correct 98 ms 79076 KB Output is correct
15 Incorrect 139 ms 78760 KB Output isn't correct
16 Correct 149 ms 78772 KB Output is correct
17 Correct 146 ms 78676 KB Output is correct
18 Correct 172 ms 78984 KB Output is correct
19 Incorrect 61 ms 78676 KB Output isn't correct
20 Correct 172 ms 79188 KB Output is correct
21 Incorrect 111 ms 79252 KB Output isn't correct
22 Correct 173 ms 79164 KB Output is correct
23 Correct 91 ms 79440 KB Output is correct
24 Correct 74 ms 78832 KB Output is correct
25 Correct 126 ms 78932 KB Output is correct
26 Incorrect 107 ms 78944 KB Output isn't correct
27 Correct 200 ms 79232 KB Output is correct
28 Incorrect 70 ms 78812 KB Output isn't correct
29 Correct 168 ms 79188 KB Output is correct
30 Correct 148 ms 79204 KB Output is correct
31 Correct 89 ms 79188 KB Output is correct
32 Incorrect 92 ms 78776 KB Output isn't correct
33 Incorrect 67 ms 78748 KB Output isn't correct
34 Correct 123 ms 79188 KB Output is correct
35 Incorrect 73 ms 78940 KB Output isn't correct
36 Correct 180 ms 79264 KB Output is correct
37 Incorrect 81 ms 79188 KB Output isn't correct
38 Correct 147 ms 78928 KB Output is correct
39 Incorrect 79 ms 78932 KB Output isn't correct
40 Correct 122 ms 78780 KB Output is correct
41 Correct 112 ms 79184 KB Output is correct
42 Correct 153 ms 78928 KB Output is correct