Submission #13857

#	Time	Username	Problem	Language	Result	Execution time	Memory
13857		gs14004	사회적 불평등 (TOKI14_social)	C++14	29 / 100	300 ms	1944 KiB

social

#include <cstdio>
#include <utility>
#include <algorithm>
using namespace std;
typedef pair<int,int> pi;
const int MAX = 10000;

int n;
pi a[100005];
int elem[10005], t[10005];

int main(){
    scanf("%d",&n);
    for (int i=0; i<n; i++) {
        scanf("%d %d",&a[i].first,&a[i].second);
    }
    sort(a,a+n);
    int p = 0;
    long long ret = 0;
    for (int i=1; i<=MAX; i++) {
        int j = p;
        while (j < n && a[j].first == i) j++;
        while (p < j) {
            long long q = 0;
            for (int k=a[p].second; k<=MAX; k++) {
                q += t[k] * (k - a[p].second);
            }
            for (int k=a[p].second; k; k--) {
                q += t[k] * (a[p].second - k);
            }
            elem[a[p].second]++;
            p++;
            ret += q;
        }
        for (int k=1; k<=MAX; k++) {
            t[k] += elem[k];
        }
    }
    printf("%lld",ret);
}

• Subtask 1: 29 / 29
• Subtask 2: 0 / 19
• Subtask 3: 0 / 20
• Subtask 4: 0 / 32