codeforces round #433 div2

A:枚举一下就行了...居然wa了一发，题目一定要看清

#include<bits/stdc++.h>
using namespace std;
int n;
int main()
{
    cin >> n;
    int mid = n /  - ((n & ) == );
    for(int i = n / ; i; --i)
    {
        if(__gcd(i, n - i) == )
        {
            printf("%d %d\n", i, n - i);
            return ;
        }
    }
    return ;
} 

B:这道题有点恶心，就是判断当前能不能每三个点有一个居民，判断一下就可以了

#include<bits/stdc++.h>
using namespace std;
int n, k;
int main()
{
    cin >> n >> k;
    if(k == )
    {
        puts("0 0");
        return ;
    }
    if(n == k || k == ) printf("0 ");
    else printf("1 ");
    int tmp1 = (n + ) / , tmp2 = (n + ) / , t = n % ;
    if(k < tmp2) printf("%d\n", k * );
    else printf("%d\n", n - k);
    return ;
} 

C:这种题只能贪心吧，似乎cf这种配对题都是贪心，开个set查询前继后继

#include<bits/stdc++.h>
using namespace std;
const int N = ;
struct data {
    long long c;
    int id;
    bool friend operator < (data a, data b)
    {
        return a.c > b.c;
    }
} a[N];
int n, k;
int answer[N];
set<long long> s;
int main()
{
    cin >> n >> k;
    for(int i = ; i <= n; ++i) scanf("%lld", &a[i].c), a[i].id = i, s.insert(i + k);
    sort(a + , a + n + );
    long long ans = ;
    for(int i = ; i <= n; ++i)
    {
        long long t1 = *(s.lower_bound(a[i].id)), t2 = *(s.upper_bound(a[i].id)), tmp;
        if(abs(a[i].id - t1) < abs(a[i].id - t2)) tmp = t1;
        else tmp = t2;
        s.erase(tmp);
        ans += abs(a[i].id - tmp) * a[i].c;
        answer[a[i].id] = tmp;
    }
    cout << ans << endl;
    for(int i = ; i <= n; ++i) printf("%d ", answer[i]);
    return ;
} 

D:考试时想了会弃了...觉得大概是枚举一下...事实上枚举一下维护前缀后缀和就行了

#include<bits/stdc++.h>
using namespace std;
const int N = ;
const long long inf = ;
struct data {
    int pos, cost;
    data(int pos, int cost) : pos(pos), cost(cost) {}
};
vector<data> v1[N], v2[N];
int n, m, k, day, cnt;
int vis[N], can1[N], can2[N];
long long sum;
long long sum1[N], sum2[N], mn[N];
int main()
{
    cin >> n >> m >> k;
    for(int i = ; i <= m; ++i)
    {
        int d, f, t, c;
        scanf("%d%d%d%d", &d, &f, &t, &c);
        day = max(day, d);
        if(t == ) v1[d].push_back(data(f, c));
        else v2[d].push_back(data(t, c));
    }
    for(int i = ; i <= n; ++i) mn[i] = inf, sum += inf;
    for(int i = ; i <= day; ++i)
    {
        for(int j = ; j < v1[i].size(); ++j)
        {
            data tmp = v1[i][j];
            if(tmp.cost < mn[tmp.pos])
            {
                sum -= mn[tmp.pos];
                sum += tmp.cost;
                mn[tmp.pos] = tmp.cost;
            }
            if(vis[tmp.pos] == )
            {
                vis[tmp.pos] = ;
                ++cnt;
            }
        }
        sum1[i] = sum;
        if(cnt == n) can1[i] = ;
//        printf("cnt = %d sum1[%d] = %lld can1[%d] = %d\n", cnt, i, sum1[i], i, can1[i]);
    }
    memset(vis, , sizeof(vis));
    sum = ;
    cnt = ;
    for(int i = ; i <= n; ++i) mn[i] = inf, sum += inf;
    for(int i = day; i ; --i)
    {
        for(int j = ; j < v2[i].size(); ++j)
        {
            data tmp = v2[i][j];
            if(tmp.cost < mn[tmp.pos])
            {
                sum -= mn[tmp.pos];
                sum += tmp.cost;
                mn[tmp.pos] = tmp.cost;
            }
            if(vis[tmp.pos] == )
            {
                vis[tmp.pos] = ;
                ++cnt;
            }
        }
        sum2[i] = sum;
        if(cnt == n) can2[i] = ;
//        printf("cnt = %d sum2[%d] = %lld can2[%d] = %d\n", cnt, i, sum2[i], i, can2[i]);
    }
    long long ans = 1ll << ;
//    puts("------------------------");
    for(int i = ; i <= day - k + ; ++i)
    {
//        printf("can1[%d] = %d can2[%d] = %d\n", i, can1[i], i + k + 1, can2[i + k + 1]);
        if(can1[i] && can2[i + k + ]) ans = min(ans, sum1[i] + sum2[i + k + ]);
    }
    cout << ((ans == 1ll << ) ? - : ans) << endl;
    return ;
}

E:考试时候石乐志觉得主席树爆空间...写了个莫队...然后错了...发现题目看错莫队做不了GG...其实很简单，静态查询区间点数,主席树维护一下，然后容斥做一下加减法就行了

#include<bits/stdc++.h>
using namespace std;
const int N = ;
int size[N * ], lc[N * ], rc[N * ], root[N];
int n, q, cnt;
void update(int l, int r, int &x, int last, int pos)
{
    size[x = ++ cnt] = size[last] + ;
    lc[x] = lc[last];
    rc[x] = rc[last];
    if(l == r) return;
    int mid = (l + r) >> ;
    if(pos <= mid) update(l, mid, lc[x], lc[last], pos);
    else update(mid + , r, rc[x], rc[last], pos);
}
int query(int l, int r, int x, int y, int a, int b)
{
    if(l > b || r < a) return ;
    if(l >= a && r <= b) return size[x] - size[y];
    int mid = (l + r) >> ;
    return (query(l, mid, lc[x], lc[y], a, b) + query(mid + , r, rc[x], rc[y], a, b));
}
int main()
{
    cin >> n >> q;
    for(int i = ; i <= n; ++i)
    {
        int x;
        scanf("%d", &x);
        update(, n, root[i], root[i - ], x);
    }
    while(q --)
    {
        int l, d, r, u;
        scanf("%d%d%d%d", &l, &d, &r, &u);
        long long ans = (long long)n * (long long)(n - ) / 2ll, tmp;
        tmp = query(, n, root[n], root[], , d - );
        ans -= tmp * (tmp - ) / 2ll;
        tmp = query(, n, root[n], root[], u + , n);
        ans -= tmp * (tmp - ) / 2ll;
        tmp = query(, n, root[l - ], root[], , n);
        ans -= tmp * (tmp - ) / 2ll;
        tmp = query(, n, root[n], root[r], , n);
        ans -= tmp * (tmp - ) / 2ll;
        tmp = query(, n, root[n], root[r], u + , n);
        ans += tmp * (tmp - ) / 2ll;
        tmp = query(, n, root[l - ], root[], u + , n);
        ans += tmp * (tmp - ) / 2ll;
        tmp = query(, n, root[n], root[r], , d - );
        ans += tmp * (tmp - ) / 2ll;
        tmp = query(, n, root[l - ], root[], , d - );
        ans += tmp * (tmp - ) / 2ll;
        printf("%lld\n", ans);
    }
    return ;
}