oj.uz

Submission #925365

# Submission time Handle Problem Language Result Execution time Memory
925365 2024-02-11T13:42:04 Z 8pete8 Brunhilda’s Birthday (BOI13_brunhilda) C++17
75.2381 / 100
 187 ms 80772 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])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 46 ms 78676 KB Output isn't correct
2 Correct 57 ms 78676 KB Output is correct
3 Correct 50 ms 78508 KB Output is correct
4 Correct 44 ms 78760 KB Output is correct
5 Correct 50 ms 78500 KB Output is correct
6 Incorrect 43 ms 78572 KB Output isn't correct
7 Correct 53 ms 78528 KB Output is correct
8 Correct 54 ms 78488 KB Output is correct
9 Correct 65 ms 78492 KB Output is correct
10 Correct 75 ms 78672 KB Output is correct
11 Correct 69 ms 78520 KB Output is correct
12 Correct 44 ms 78500 KB Output is correct
13 Correct 123 ms 78676 KB Output is correct
14 Correct 131 ms 78776 KB Output is correct
15 Correct 63 ms 78676 KB Output is correct
16 Correct 58 ms 78596 KB Output is correct
17 Correct 56 ms 78676 KB Output is correct
18 Correct 43 ms 78676 KB Output is correct

Subtask #2
18.8888888889 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 78676 KB Output is correct
2 Correct 64 ms 79616 KB Output is correct
3 Correct 157 ms 79444 KB Output is correct
4 Correct 67 ms 78676 KB Output is correct
5 Correct 109 ms 79056 KB Output is correct
6 Correct 59 ms 78628 KB Output is correct
7 Correct 56 ms 78768 KB Output is correct
8 Correct 66 ms 78500 KB Output is correct
9 Correct 119 ms 79448 KB Output is correct
10 Correct 154 ms 79444 KB Output is correct
11 Incorrect 164 ms 78924 KB Output isn't correct
12 Correct 89 ms 78512 KB Output is correct
13 Correct 47 ms 78520 KB Output is correct
14 Correct 65 ms 78520 KB Output is correct
15 Correct 119 ms 78944 KB Output is correct
16 Correct 62 ms 79644 KB Output is correct
17 Correct 134 ms 78676 KB Output is correct
18 Correct 132 ms 79700 KB Output is correct

Subtask #3
38.5714285714 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 79460 KB Output is correct
2 Correct 166 ms 79400 KB Output is correct
3 Correct 171 ms 79704 KB Output is correct
4 Incorrect 114 ms 79640 KB Output isn't correct
5 Incorrect 80 ms 80640 KB Output isn't correct
6 Correct 148 ms 79700 KB Output is correct
7 Correct 124 ms 80288 KB Output is correct
8 Correct 137 ms 79444 KB Output is correct
9 Correct 132 ms 79448 KB Output is correct
10 Correct 105 ms 78676 KB Output is correct
11 Incorrect 88 ms 78920 KB Output isn't correct
12 Correct 123 ms 78880 KB Output is correct
13 Correct 159 ms 79952 KB Output is correct
14 Correct 96 ms 79856 KB Output is correct
15 Incorrect 121 ms 78928 KB Output isn't correct
16 Correct 144 ms 78884 KB Output is correct
17 Correct 126 ms 79180 KB Output is correct
18 Correct 160 ms 79444 KB Output is correct
19 Incorrect 64 ms 78972 KB Output isn't correct
20 Correct 170 ms 79700 KB Output is correct
21 Incorrect 102 ms 79956 KB Output isn't correct
22 Correct 178 ms 80724 KB Output is correct
23 Correct 84 ms 79952 KB Output is correct
24 Correct 72 ms 79532 KB Output is correct
25 Incorrect 123 ms 79636 KB Output isn't correct
26 Incorrect 113 ms 79636 KB Output isn't correct
27 Correct 187 ms 80208 KB Output is correct
28 Incorrect 66 ms 79700 KB Output isn't correct
29 Correct 165 ms 80572 KB Output is correct
30 Correct 152 ms 80600 KB Output is correct
31 Correct 80 ms 79568 KB Output is correct
32 Incorrect 91 ms 79652 KB Output isn't correct
33 Incorrect 68 ms 79444 KB Output isn't correct
34 Correct 126 ms 80284 KB Output is correct
35 Incorrect 71 ms 79700 KB Output isn't correct
36 Correct 169 ms 80552 KB Output is correct
37 Incorrect 81 ms 80772 KB Output isn't correct
38 Correct 146 ms 79524 KB Output is correct
39 Incorrect 78 ms 79700 KB Output isn't correct
40 Correct 127 ms 79748 KB Output is correct
41 Correct 109 ms 80212 KB Output is correct
42 Incorrect 154 ms 79952 KB Output isn't correct