Submission #1103270

#	Time	Username	Problem	Language	Result	Execution time	Memory
1103270		modwwe	Swap Swap Sort (CCO21_day1problem1)	C++17	11 / 25	5045 ms	164436 KiB

Main

#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#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".out","w",stdout)
#define pb push_back
#define mask(i) (1<<i)
#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 = 1e18;
const int mod2 = 1e9 + 7;
const int  mod1 = 998244353;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    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,limit,w,l,r,last,root;
int kk;
int el = 19;

main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
///modwwe
    phongbeo();
    // checktime
}
unordered_set<int> c[100001];
int a[100001];
int b[100001];
unordered_map<int,int> cost[100001];
int f[100001];
int ask[1000001];
int bit[100001];
void upd(int x)
{
    for(x; x; x-=x&-x) bit[x]++;
}
int get(int x)
{
    int s=0;
    for(x; x<=n; x+=x&-x)s+=bit[x];
    return s;
}
void  setup()
{
    s4=0;
    for(int i=1; i<=n; i++)
    {
        s4+=get(a[i]);
        upd(a[i]-1);
    }
}
void phongbeo()
{
    cin>>n>>k>>m;
    for(int i=1; i<=n; i++)
        cin>>a[i];
    for(int i=1; i<=k; i++)
        b[i]=i;
    for(int i=1; i<=m; i++)
    {
        cin>>ask[i];
        l=ask[i];
        c[b[l]].insert({b[l+1]});
        c[b[l+1]].insert(b[l]);
                swap(b[l],b[l+1]);
    }
    for(int i=1; i<=n; i++)
    {
       for(auto x:c[a[i]])
        {
           cost[a[i]][x]+=f[x];
        }
        f[a[i]]++;
    }
    for(int i=1; i<=k; i++)
        b[i]=i;
    setup();
    for(int i=1; i<=m; i++)
    {
        l=ask[i];
        s2=b[l];
        s3=b[l+1];
        swap(b[l],b[l+1]);
        s4=s4-cost[s2][s3]+cost[s3][s2];
        cout<<s4,down
    }
}

Compilation message (stderr)

Main.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main()
      | ^~~~
Main.cpp: In function 'void upd(long long int)':
Main.cpp:92:9: warning: statement has no effect [-Wunused-value]
   92 |     for(x; x; x-=x&-x) bit[x]++;
      |         ^
Main.cpp: In function 'long long int get(long long int)':
Main.cpp:97:9: warning: statement has no effect [-Wunused-value]
   97 |     for(x; x<=n; x+=x&-x)s+=bit[x];
      |         ^
Main.cpp: In function 'int main()':
Main.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 fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:74:9: note: in expansion of macro 'fin'
   74 |         fin(task);
      |         ^~~
Main.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:75:9: note: in expansion of macro 'fou'
   75 |         fou(task);
      |         ^~~

• Subtask 1: 3 / 3
• Subtask 2: 3 / 3
• Subtask 3: 5 / 5
• Subtask 4: 0 / 14