제출 #1123396

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1123396		BABY_GANGSTER	Diversity (CEOI21_diversity)	C++20	0 / 100	1 ms	328 KiB

diversity

#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define int  long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define mp make_pair
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
}
void phongbeo();
const int inf = 1e9;
const ll mod2 = 998244353;
const int  mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0)x+=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a, b, c;
};
struct id
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,lim,w,l,r ;
int kk;
int el = 19;
main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
    // modwwe
    phongbeo();
    // checktime
}
vector<int> v;
vector<int> ans;
int c[300001];
int a[300001];
void phongbeo()
{
    cin>>n>>m;
/// chi co sqrt(gia tri khac nhau =)) )
    for(int i=1; i<=n; i++)
        cin>>a[i],c[a[i]]++;
    for(int i=1; i<=300000; i++)
        if(c[i])
            v.pb(c[i]);
    cin>>l>>r;
    int minn=inf;
    while(next_permutation(v.begin(),v.end()))
    {
        s4=0;
        for(int i=0; i<v.size(); i++)
        {
            s4=s4+v[i]*(v[i]+1)/2;
            for(int j=0; j<i; j++)
                s4=s4+v[i]*v[j]*(i-j+1);
        }
        if(s4<minn)
        {
            minn=s4;
            ans=v;
        }
    }
    cout<<minn;

}

컴파일 시 표준 에러 (stderr) 메시지

diversity.cpp:74:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   74 | main()
      | ^~~~
diversity.cpp: In function 'int main()':
diversity.cpp:12:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
diversity.cpp:78:9: note: in expansion of macro 'fin'
   78 |         fin(task);
      |         ^~~
diversity.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fou(x) freopen(x".ans","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
diversity.cpp:79:9: note: in expansion of macro 'fou'
   79 |         fou(task);
      |         ^~~

• Subtask 1: 0 / 4
• Subtask 2: 0 / 10
• Subtask 3: 0 / 8
• Subtask 4: 0 / 16
• Subtask 5: 0 / 26
• Subtask 6: 0 / 36