oj.uz

Submission #925367

# Submission time Handle Problem Language Result Execution time Memory
925367 2024-02-11T13:44:32 Z 8pete8 Brunhilda’s Birthday (BOI13_brunhilda) C++17
75.2381 / 100
 193 ms 79356 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++)ans[i]=ans[i-mx[i]]+1;
	while(q--){
		int g;cin>>g;
		if(mx[g]>0)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
17.7777777778 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 78708 KB Output isn't correct
2 Correct 60 ms 78672 KB Output is correct
3 Correct 63 ms 78676 KB Output is correct
4 Correct 46 ms 78712 KB Output is correct
5 Correct 49 ms 78552 KB Output is correct
6 Incorrect 43 ms 78584 KB Output isn't correct
7 Correct 53 ms 78676 KB Output is correct
8 Correct 55 ms 78672 KB Output is correct
9 Correct 66 ms 78484 KB Output is correct
10 Correct 81 ms 78676 KB Output is correct
11 Correct 74 ms 78672 KB Output is correct
12 Correct 43 ms 78576 KB Output is correct
13 Correct 129 ms 78492 KB Output is correct
14 Correct 140 ms 78672 KB Output is correct
15 Correct 64 ms 78676 KB Output is correct
16 Correct 65 ms 78932 KB Output is correct
17 Correct 57 ms 78676 KB Output is correct
18 Correct 45 ms 78672 KB Output is correct

Subtask #2
18.8888888889 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 78672 KB Output is correct
2 Correct 70 ms 78944 KB Output is correct
3 Correct 171 ms 78776 KB Output is correct
4 Correct 64 ms 78672 KB Output is correct
5 Correct 110 ms 78708 KB Output is correct
6 Correct 58 ms 78676 KB Output is correct
7 Correct 60 ms 78692 KB Output is correct
8 Correct 66 ms 78672 KB Output is correct
9 Correct 129 ms 78796 KB Output is correct
10 Correct 160 ms 78792 KB Output is correct
11 Incorrect 169 ms 78672 KB Output isn't correct
12 Correct 86 ms 78500 KB Output is correct
13 Correct 50 ms 78676 KB Output is correct
14 Correct 65 ms 78512 KB Output is correct
15 Correct 130 ms 78664 KB Output is correct
16 Correct 66 ms 78936 KB Output is correct
17 Correct 143 ms 78520 KB Output is correct
18 Correct 155 ms 78952 KB Output is correct

Subtask #3
38.5714285714 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 78952 KB Output is correct
2 Correct 193 ms 78964 KB Output is correct
3 Correct 168 ms 78944 KB Output is correct
4 Incorrect 108 ms 78760 KB Output isn't correct
5 Incorrect 78 ms 79188 KB Output isn't correct
6 Correct 155 ms 78792 KB Output is correct
7 Correct 124 ms 79148 KB Output is correct
8 Correct 139 ms 78932 KB Output is correct
9 Correct 139 ms 78876 KB Output is correct
10 Correct 109 ms 78764 KB Output is correct
11 Incorrect 95 ms 78672 KB Output isn't correct
12 Correct 133 ms 78676 KB Output is correct
13 Correct 165 ms 78932 KB Output is correct
14 Correct 102 ms 79252 KB Output is correct
15 Incorrect 136 ms 78676 KB Output isn't correct
16 Correct 141 ms 78768 KB Output is correct
17 Correct 126 ms 78904 KB Output is correct
18 Correct 171 ms 78940 KB Output is correct
19 Incorrect 55 ms 78672 KB Output isn't correct
20 Correct 173 ms 78956 KB Output is correct
21 Incorrect 110 ms 79272 KB Output isn't correct
22 Correct 181 ms 79192 KB Output is correct
23 Correct 85 ms 78928 KB Output is correct
24 Correct 77 ms 78932 KB Output is correct
25 Incorrect 125 ms 78928 KB Output isn't correct
26 Incorrect 109 ms 78764 KB Output isn't correct
27 Correct 189 ms 79188 KB Output is correct
28 Incorrect 66 ms 78932 KB Output isn't correct
29 Correct 173 ms 79160 KB Output is correct
30 Correct 158 ms 79080 KB Output is correct
31 Correct 90 ms 78848 KB Output is correct
32 Incorrect 100 ms 78928 KB Output isn't correct
33 Incorrect 66 ms 78932 KB Output isn't correct
34 Correct 124 ms 79144 KB Output is correct
35 Incorrect 71 ms 78928 KB Output isn't correct
36 Correct 188 ms 79356 KB Output is correct
37 Incorrect 82 ms 79148 KB Output isn't correct
38 Correct 147 ms 78776 KB Output is correct
39 Incorrect 80 ms 78932 KB Output isn't correct
40 Correct 134 ms 79036 KB Output is correct
41 Correct 108 ms 79144 KB Output is correct
42 Incorrect 144 ms 78928 KB Output isn't correct