/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Accepted 8ms 964.0 KiB
#3 Accepted 10ms 836.0 KiB
#4 Accepted 8ms 964.0 KiB
#5 Accepted 10ms 960.0 KiB
#6 Accepted 11ms 956.0 KiB
#7 Accepted 12ms 788.0 KiB
#8 Accepted 17ms 960.0 KiB
#9 Accepted 24ms 1000.0 KiB
#10 Accepted 45ms 1.391 MiB
#11 Accepted 97ms 2.438 MiB
#12 Accepted 92ms 2.438 MiB
#13 Accepted 74ms 2.438 MiB
#14 Accepted 113ms 2.438 MiB
#15 Accepted 128ms 2.434 MiB
#16 Accepted 130ms 2.438 MiB
#17 Accepted 688ms 2.09 MiB
#18 Time Exceeded ≥4071ms ≥1.828 MiB

Code

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbg(a,b,c,d) cerr<<a<<"  "<<b<<"  "<<c<<"  "<<d<<endl;
#define kill(a) {cout<<a<<endl;continue;}
#define KILL(a) {cout<<a<<endl;return 0;}
#define debug cerr<<"Error Found"<<endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define lcm(a, b) (a/__gcd(a,b))*b
#define w(t) cin>>t;while(t--)
#define pi  2 * acos(0.0)
#define endl "\n"
int t, cs = 0;
const int mxn = 1e6 + 3, mod = 1e9 + 7;
int freq[mxn];
int32_t main()
{
   fast;
    w(t)
    {
        int n, x;
        cin >> n >> x;
        map<int,int>freq;
        int mx = 0;
        int ar[n];
        for(int i = 0, a; i < n; i++)cin >> ar[i], freq[ar[i]]++, mx = max(mx, ar[i]);
        int last = min(x, mx + 1);
        int64_t mn = 1e18;
        int K;
        for(int i = 1; i <= last; i++)
        {
            int64_t cnt = 0;
            for(int j = i; j <= mx; j += i)
            {
                cnt += 1LL * j * freq[j];
            }
            if(cnt < mn)mn = cnt, K = i;
        }
        for(int i = 0; i < n; i++)freq[ar[i]] = 0;
        cout << K << endl;
    }
}

Information

Submit By
Type
Submission
Problem
P1039 Prince Roy, the undisputed ruler of the world
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-07 06:33:08
Judged At
2024-11-11 02:23:34
Judged By
Score
95
Total Time
≥4071ms
Peak Memory
≥2.438 MiB