답안 #116462

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
116462	2019-06-12T13:52:35 Z	oolimry	NLO (COCI18_nlo)	C++14	88 / 110	430 ms	65536 KB

nlo

#include <bits/stdc++.h>

using namespace std;

int main()
{
    //freopen("i.txt","r",stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    long long n, m;
    cin >> n >> m;
    typedef pair<int, int> ii;

    static vector<ii> stuff[100005];

    int q;
    cin >> q;
    for(int i = 0;i < n;i++){
        stuff[i].push_back(ii(0,0));
        stuff[i].push_back(ii(m,0));
    }
    for(int qq = 1;qq <= q;qq++){
        long long x, y, r;
        cin >> y >> x >> r;
        x--;
        y--;

        for(int i = y - r;i <= y + r;i++){
            long long dy = abs(i - y);
            long long dx = sqrt(r * r - dy * dy);

            //cout << dx << " " << dy << " " << r << "\n";
            stuff[i].push_back(ii(x - dx,qq));
            stuff[i].push_back(ii(x + dx + 1,-1 * qq));
        }
    }
    long long ans = 0;
    for(int i = 0;i < n;i++){
        sort(stuff[i].begin(),stuff[i].end());

        set<long long> values;

        for(int j = 0;j < stuff[i].size();j++){
            if(j != 0 && stuff[i][j].first != stuff[i][j-1].first){
                set<long long>::iterator it = values.end();
                it--;
                long long v1 = q - *it;
                long long v2 = stuff[i][j].first - stuff[i][j-1].first;
                ans += v1 * v2;


                //cout << ans << " ";
            }

            if(stuff[i][j].second >= 0){
                values.insert(stuff[i][j].second);
            }
            else{
                values.erase(-1 * stuff[i][j].second);
            }

        }
        //cout << ans << "\n";
    }
    cout << ans;
    return 0;
}

Compilation message

nlo.cpp: In function 'int main()':
nlo.cpp:43:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0;j < stuff[i].size();j++){
                       ~~^~~~~~~~~~~~~~~~~

Subtask #1

88.0 / 110.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	3072 KB	Output is correct
2	Correct	17 ms	3840 KB	Output is correct
3	Correct	12 ms	3968 KB	Output is correct
4	Correct	63 ms	9592 KB	Output is correct
5	Correct	48 ms	8568 KB	Output is correct
6	Correct	430 ms	49464 KB	Output is correct
7	Correct	152 ms	21704 KB	Output is correct
8	Runtime error	426 ms	65536 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
9	Correct	332 ms	36216 KB	Output is correct
10	Runtime error	394 ms	65536 KB	Execution killed with signal 9 (could be triggered by violating memory limits)