oj.uz

답안 #171240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
171240 2019-12-28T04:19:16 Z arnold518 새 집 (APIO18_new_home) C++14
47 / 100
 5000 ms 617704 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 3e5;
const int INF = 2e8;

struct Data { int x, t, a, b; };
struct Query { int l, y, p; };

int N, K, Q, C;
Data A[MAXN*2+10];
Query query[MAXN+10];
vector<int> comp;
int ans[MAXN+10];

int getcomp(int x) { return lower_bound(comp.begin(), comp.end(), x)-comp.begin()+1; }

struct Line
{
    int x, y;
    Line() {}
    Line(int x, int y) : x(x), y(y) {}
    bool operator < (const Line &p) const { return pii(x, y)<pii(p.x, p.y); }
};

Line Line1(int x, int y) { return Line(x, y-x); }
Line Line2(int x, int y) { return Line(y, y-x); }

multiset<int> S[MAXN+10];

//==================================================

map<Line, pii> M1;
vector<Line> tree1[MAXN*12+10];

void update1(int node, int tl, int tr, int l, int r, Line val)
{
    if(l<=tl && tr<=r) { tree1[node].push_back(val); return; }
    if(r<tl || tr<l) return;
    int mid=tl+tr>>1;
    update1(node*2, tl, mid, l, r, val);
    update1(node*2+1, mid+1, tr, l, r, val);
}

void pushLine1(int x, int y, int t)
{
    Line p=Line1(x, y);
    if(M1[p].second==0) M1[p].first=t;
    M1[p].second++;
}

void popLine1(int x, int y, int t)
{
    Line p=Line1(x, y);
    M1[p].second--;
    if(M1[p].second==0) update1(1, 1, C, M1[p].first, t, p);
}

//==================================================

map<Line, pii> M2;
vector<Line> tree2[MAXN*12+10];

void update2(int node, int tl, int tr, int l, int r, Line val)
{
    if(l<=tl && tr<=r) { tree2[node].push_back(val); return; }
    if(r<tl || tr<l) return;
    int mid=tl+tr>>1;
    update2(node*2, tl, mid, l, r, val);
    update2(node*2+1, mid+1, tr, l, r, val);
}

void pushLine2(int x, int y, int t)
{
    Line p=Line2(x, y);
    if(M2[p].second==0) M2[p].first=t;
    M2[p].second++;
}

void popLine2(int x, int y, int t)
{
    Line p=Line2(x, y);
    M2[p].second--;
    if(M2[p].second==0) update2(1, 1, C, M2[p].first, t, p);
}

//==================================================

vector<Query> tree3[MAXN*12+10];
vector<int> tree4[MAXN*12+10];

void update3(int node, int tl, int tr, int pos, Query val)
{
    tree3[node].push_back(val);
    if(tl==tr) return;
    int mid=tl+tr>>1;
    if(pos<=mid) update3(node*2, tl, mid, pos, val);
    else update3(node*2+1, mid+1, tr, pos, val);
}

void update4(int node, int tl, int tr, int l, int r, int val)
{
    if(l<=tl && tr<=r) { tree4[node].push_back(val); return; }
    if(r<tl || tr<l) return;
    int mid=tl+tr>>1;
    update4(node*2, tl, mid, l, r, val);
    update4(node*2+1, mid+1, tr, l, r, val);
}

int SS[MAXN+10], cnt=0;

void dfs(int node, int tl, int tr)
{
    int i, j;

    //printf("%d %d %d\n", node, tl, tr);
    //printf("==============S\n");
    //for(auto it : tree1[node]) printf("%d %d / ", it.x, it.y); printf("\n");
    //for(auto it : tree2[node]) printf("%d %d / ", it.x, it.y); printf("\n");
    //for(auto it : tree3[node]) printf("%d %d / ", it.l, it.y); printf("\n");
    //printf("==============E\n");

    sort(tree1[node].begin(), tree1[node].end(), [&](const Line &p, const Line &q) { return p.x!=q.x ? p.x<q.x : p.y<q.y; });
    sort(tree3[node].begin(), tree3[node].end(), [&](const Query &p, const Query &q) { return p.l<q.l; });

    for(auto it : tree4[node])
    {
        if(SS[it]==0) cnt++;
        SS[it]++;
    }

    int val=-1;
    for(i=0, j=0; i<tree3[node].size(); i++)
    {
        Query now=tree3[node][i];
        for(; j<tree1[node].size() && tree1[node][j].x<=now.l; j++)
        {
            Line t=tree1[node][j];
            val=max(val, t.x+t.y);
            ans[now.p]=max(ans[now.p], val-now.l);
            //printf("!%d %d\n", i, j);
        }
        if(j) j--;
    }

    sort(tree2[node].begin(), tree2[node].end(), [&](const Line &p, const Line &q) { return p.x!=q.x ? p.x>q.x : p.y<q.y; });
    sort(tree3[node].begin(), tree3[node].end(), [&](const Query &p, const Query &q) { return p.l>q.l; });

    val=INF+1;
    for(i=0, j=0; i<tree3[node].size(); i++)
    {
        Query now=tree3[node][i];
        for(; j<tree2[node].size() && tree2[node][j].x>=now.l; j++)
        {
            Line t=tree2[node][j];
            val=min(val, t.x-t.y);
            ans[now.p]=max(ans[now.p], now.l-val);
        }
        if(j) j--;
    }

    if(tl==tr)
    {
        if(cnt!=K) for(auto it : tree3[node]) ans[it.p]=-2;

        for(auto it : tree4[node])
        {
            SS[it]--;
            if(SS[it]==0) cnt--;
        }
        return;
    }

    int mid=tl+tr>>1;
    dfs(node*2, tl, mid);
    dfs(node*2+1, mid+1, tr);

    for(auto it : tree4[node])
    {
        SS[it]--;
        if(SS[it]==0) cnt--;
    }
}

int main()
{
    int i, j;

    scanf("%d%d%d", &N, &K, &Q);
    for(i=1; i<=N; i++)
    {
        int x, t, a, b;
        scanf("%d%d%d%d", &x, &t, &a, &b); x*=2; a=a*3-1; b=b*3+1;
        A[i*2-1]={x, t, a, -1};
        A[i*2]={x, t, b, 1};
        comp.push_back(a);
        comp.push_back(b);
    }

    for(i=1; i<=Q; i++)
    {
        scanf("%d%d", &query[i].l, &query[i].y); query[i].y*=3;
        query[i].p=i;
        comp.push_back(query[i].y); query[i].l*=2;
    }

    sort(comp.begin(), comp.end());
    comp.erase(unique(comp.begin(), comp.end()), comp.end());
    C=comp.size();

    for(i=1; i<=2*N; i++) A[i].a=getcomp(A[i].a);
    for(i=1; i<=N; i++) update4(1, 1, C, A[i*2-1].a, A[i*2].a, A[i*2].t);
    for(i=1; i<=Q; i++) query[i].y=getcomp(query[i].y);
    for(i=1; i<=Q; i++) update3(1, 1, C, query[i].y, query[i]);

    sort(A+1, A+N+N+1, [&](const Data &p, const Data &q) { return p.a<q.a; });

    for(i=1; i<=N+N; i++)
    {
        Data now=A[i];
        int x, t, a, b;
        x=now.x; t=now.t; a=now.a; b=now.b;
        //printf("%d %d %d %d\n", x, t, a, b);
        if(b==-1)
        {
            if(S[t].find(x)==S[t].end())
            {
                if(S[t].size()==0)
                {
                    pushLine1(0, x, a);
                    pushLine2(x, INF, a);
                }
                else
                {
                    auto it=S[t].lower_bound(x);
                    int l, r;
                    if(it==S[t].end())
                    {
                        l=*prev(it);
                        popLine2(l, INF, a);
                        pushLine2(l, l+x>>1, a);
                        pushLine1(l+x>>1, x, a);
                        pushLine2(x, INF, a);
                    }
                    else if(it==S[t].begin())
                    {
                        r=*it;
                        popLine1(0, r, a);
                        pushLine1(0, x, a);
                        pushLine2(x, r+x>>1, a);
                        pushLine1(r+x>>1, r, a);
                    }
                    else
                    {
                        r=*it, l=*prev(it);
                        popLine2(l, l+r>>1, a);
                        popLine1(l+r>>1, r, a);
                        pushLine2(l, l+x>>1, a);
                        pushLine1(l+x>>1, x, a);
                        pushLine2(x, x+r>>1, a);
                        pushLine1(x+r>>1, r, a);
                    }
                }
            }
            S[t].insert(x);
        }
        else
        {
            S[t].erase(S[t].find(x));
            if(S[t].find(x)==S[t].end())
            {
                if(S[t].size()==0)
                {
                    popLine1(0, x, a);
                    popLine2(x, INF, a);
                }
                else
                {
                    auto it=S[t].lower_bound(x);
                    int l, r;
                    if(it==S[t].end())
                    {
                        l=*prev(it);
                        pushLine2(l, INF, a);
                        popLine2(l, l+x>>1, a);
                        popLine1(l+x>>1, x, a);
                        popLine2(x, INF, a);
                    }
                    else if(it==S[t].begin())
                    {
                        r=*it;
                        pushLine1(0, r, a);
                        popLine1(0, x, a);
                        popLine2(x, r+x>>1, a);
                        popLine1(r+x>>1, r, a);
                    }
                    else
                    {
                        r=*it, l=*prev(it);
                        pushLine2(l, l+r>>1, a);
                        pushLine1(l+r>>1, r, a);
                        popLine2(l, l+x>>1, a);
                        popLine1(l+x>>1, x, a);
                        popLine2(x, x+r>>1, a);
                        popLine1(x+r>>1, r, a);
                    }
                }
            }
        }
    }
    dfs(1, 1, C);

    for(i=1; i<=Q; i++) printf("%d\n", ans[i]/2);
}

Compilation message

new_home.cpp: In function 'void update1(int, int, int, int, int, Line)':
new_home.cpp:44:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
new_home.cpp: In function 'void update2(int, int, int, int, int, Line)':
new_home.cpp:72:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
new_home.cpp: In function 'void update3(int, int, int, int, Query)':
new_home.cpp:100:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
new_home.cpp: In function 'void update4(int, int, int, int, int, int)':
new_home.cpp:109:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
new_home.cpp: In function 'void dfs(int, int, int)':
new_home.cpp:137:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0, j=0; i<tree3[node].size(); i++)
                   ~^~~~~~~~~~~~~~~~~~~
new_home.cpp:140:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(; j<tree1[node].size() && tree1[node][j].x<=now.l; j++)
               ~^~~~~~~~~~~~~~~~~~~
new_home.cpp:154:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0, j=0; i<tree3[node].size(); i++)
                   ~^~~~~~~~~~~~~~~~~~~
new_home.cpp:157:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(; j<tree2[node].size() && tree2[node][j].x>=now.l; j++)
               ~^~~~~~~~~~~~~~~~~~~
new_home.cpp:178:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
new_home.cpp: In function 'int main()':
new_home.cpp:245:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(l, l+x>>1, a);
                                      ~^~
new_home.cpp:246:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(l+x>>1, x, a);
                                   ~^~
new_home.cpp:254:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(x, r+x>>1, a);
                                      ~^~
new_home.cpp:255:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(r+x>>1, r, a);
                                   ~^~
new_home.cpp:260:38: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine2(l, l+r>>1, a);
                                     ~^~
new_home.cpp:261:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine1(l+r>>1, r, a);
                                  ~^~
new_home.cpp:262:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(l, l+x>>1, a);
                                      ~^~
new_home.cpp:263:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(l+x>>1, x, a);
                                   ~^~
new_home.cpp:264:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(x, x+r>>1, a);
                                      ~^~
new_home.cpp:265:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(x+r>>1, r, a);
                                   ~^~
new_home.cpp:289:38: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine2(l, l+x>>1, a);
                                     ~^~
new_home.cpp:290:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine1(l+x>>1, x, a);
                                  ~^~
new_home.cpp:298:38: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine2(x, r+x>>1, a);
                                     ~^~
new_home.cpp:299:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine1(r+x>>1, r, a);
                                  ~^~
new_home.cpp:304:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(l, l+r>>1, a);
                                      ~^~
new_home.cpp:305:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(l+r>>1, r, a);
                                   ~^~
new_home.cpp:306:38: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine2(l, l+x>>1, a);
                                     ~^~
new_home.cpp:307:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine1(l+x>>1, x, a);
                                  ~^~
new_home.cpp:308:38: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine2(x, x+r>>1, a);
                                     ~^~
new_home.cpp:309:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine1(x+r>>1, r, a);
                                  ~^~
new_home.cpp:191:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
new_home.cpp:193:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &N, &K, &Q);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:197:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d%d", &x, &t, &a, &b); x*=2; a=a*3-1; b=b*3+1;
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:206:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &query[i].l, &query[i].y); query[i].y*=3;
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 338 ms 352732 KB Output is correct
2 Correct 335 ms 352632 KB Output is correct
3 Correct 338 ms 352760 KB Output is correct
4 Correct 340 ms 352644 KB Output is correct
5 Correct 365 ms 352832 KB Output is correct
6 Correct 384 ms 353136 KB Output is correct
7 Correct 402 ms 352864 KB Output is correct
8 Correct 392 ms 353140 KB Output is correct
9 Correct 375 ms 353108 KB Output is correct
10 Correct 363 ms 353352 KB Output is correct
11 Correct 399 ms 352988 KB Output is correct
12 Correct 377 ms 353040 KB Output is correct
13 Correct 393 ms 352848 KB Output is correct
14 Correct 350 ms 353032 KB Output is correct
15 Correct 374 ms 353140 KB Output is correct
16 Correct 379 ms 353040 KB Output is correct
17 Correct 381 ms 353120 KB Output is correct
18 Correct 369 ms 353116 KB Output is correct
19 Correct 340 ms 353016 KB Output is correct
20 Correct 339 ms 353144 KB Output is correct
21 Correct 338 ms 352716 KB Output is correct
22 Correct 356 ms 353116 KB Output is correct
23 Correct 343 ms 353144 KB Output is correct
24 Correct 337 ms 353196 KB Output is correct
25 Correct 349 ms 353076 KB Output is correct
26 Correct 351 ms 353192 KB Output is correct
27 Correct 367 ms 352904 KB Output is correct
28 Correct 343 ms 353016 KB Output is correct
29 Correct 345 ms 352876 KB Output is correct
30 Correct 356 ms 352908 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 338 ms 352732 KB Output is correct
2 Correct 335 ms 352632 KB Output is correct
3 Correct 338 ms 352760 KB Output is correct
4 Correct 340 ms 352644 KB Output is correct
5 Correct 365 ms 352832 KB Output is correct
6 Correct 384 ms 353136 KB Output is correct
7 Correct 402 ms 352864 KB Output is correct
8 Correct 392 ms 353140 KB Output is correct
9 Correct 375 ms 353108 KB Output is correct
10 Correct 363 ms 353352 KB Output is correct
11 Correct 399 ms 352988 KB Output is correct
12 Correct 377 ms 353040 KB Output is correct
13 Correct 393 ms 352848 KB Output is correct
14 Correct 350 ms 353032 KB Output is correct
15 Correct 374 ms 353140 KB Output is correct
16 Correct 379 ms 353040 KB Output is correct
17 Correct 381 ms 353120 KB Output is correct
18 Correct 369 ms 353116 KB Output is correct
19 Correct 340 ms 353016 KB Output is correct
20 Correct 339 ms 353144 KB Output is correct
21 Correct 338 ms 352716 KB Output is correct
22 Correct 356 ms 353116 KB Output is correct
23 Correct 343 ms 353144 KB Output is correct
24 Correct 337 ms 353196 KB Output is correct
25 Correct 349 ms 353076 KB Output is correct
26 Correct 351 ms 353192 KB Output is correct
27 Correct 367 ms 352904 KB Output is correct
28 Correct 343 ms 353016 KB Output is correct
29 Correct 345 ms 352876 KB Output is correct
30 Correct 356 ms 352908 KB Output is correct
31 Correct 3408 ms 462252 KB Output is correct
32 Correct 503 ms 364380 KB Output is correct
33 Correct 2844 ms 466424 KB Output is correct
34 Correct 3155 ms 464776 KB Output is correct
35 Correct 2885 ms 462956 KB Output is correct
36 Correct 2827 ms 463372 KB Output is correct
37 Correct 2281 ms 457724 KB Output is correct
38 Correct 2136 ms 458120 KB Output is correct
39 Correct 1582 ms 442592 KB Output is correct
40 Correct 1773 ms 446492 KB Output is correct
41 Correct 2079 ms 434624 KB Output is correct
42 Correct 1962 ms 435568 KB Output is correct
43 Correct 442 ms 364200 KB Output is correct
44 Correct 1908 ms 433536 KB Output is correct
45 Correct 1790 ms 428496 KB Output is correct
46 Correct 1535 ms 419136 KB Output is correct
47 Correct 1203 ms 413872 KB Output is correct
48 Correct 1111 ms 412880 KB Output is correct
49 Correct 1228 ms 420908 KB Output is correct
50 Correct 1424 ms 430540 KB Output is correct
51 Correct 1233 ms 418456 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5045 ms 577200 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5066 ms 617704 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 338 ms 352732 KB Output is correct
2 Correct 335 ms 352632 KB Output is correct
3 Correct 338 ms 352760 KB Output is correct
4 Correct 340 ms 352644 KB Output is correct
5 Correct 365 ms 352832 KB Output is correct
6 Correct 384 ms 353136 KB Output is correct
7 Correct 402 ms 352864 KB Output is correct
8 Correct 392 ms 353140 KB Output is correct
9 Correct 375 ms 353108 KB Output is correct
10 Correct 363 ms 353352 KB Output is correct
11 Correct 399 ms 352988 KB Output is correct
12 Correct 377 ms 353040 KB Output is correct
13 Correct 393 ms 352848 KB Output is correct
14 Correct 350 ms 353032 KB Output is correct
15 Correct 374 ms 353140 KB Output is correct
16 Correct 379 ms 353040 KB Output is correct
17 Correct 381 ms 353120 KB Output is correct
18 Correct 369 ms 353116 KB Output is correct
19 Correct 340 ms 353016 KB Output is correct
20 Correct 339 ms 353144 KB Output is correct
21 Correct 338 ms 352716 KB Output is correct
22 Correct 356 ms 353116 KB Output is correct
23 Correct 343 ms 353144 KB Output is correct
24 Correct 337 ms 353196 KB Output is correct
25 Correct 349 ms 353076 KB Output is correct
26 Correct 351 ms 353192 KB Output is correct
27 Correct 367 ms 352904 KB Output is correct
28 Correct 343 ms 353016 KB Output is correct
29 Correct 345 ms 352876 KB Output is correct
30 Correct 356 ms 352908 KB Output is correct
31 Correct 3408 ms 462252 KB Output is correct
32 Correct 503 ms 364380 KB Output is correct
33 Correct 2844 ms 466424 KB Output is correct
34 Correct 3155 ms 464776 KB Output is correct
35 Correct 2885 ms 462956 KB Output is correct
36 Correct 2827 ms 463372 KB Output is correct
37 Correct 2281 ms 457724 KB Output is correct
38 Correct 2136 ms 458120 KB Output is correct
39 Correct 1582 ms 442592 KB Output is correct
40 Correct 1773 ms 446492 KB Output is correct
41 Correct 2079 ms 434624 KB Output is correct
42 Correct 1962 ms 435568 KB Output is correct
43 Correct 442 ms 364200 KB Output is correct
44 Correct 1908 ms 433536 KB Output is correct
45 Correct 1790 ms 428496 KB Output is correct
46 Correct 1535 ms 419136 KB Output is correct
47 Correct 1203 ms 413872 KB Output is correct
48 Correct 1111 ms 412880 KB Output is correct
49 Correct 1228 ms 420908 KB Output is correct
50 Correct 1424 ms 430540 KB Output is correct
51 Correct 1233 ms 418456 KB Output is correct
52 Correct 1501 ms 416700 KB Output is correct
53 Correct 1694 ms 420408 KB Output is correct
54 Correct 2602 ms 440336 KB Output is correct
55 Correct 1846 ms 431936 KB Output is correct
56 Correct 1680 ms 428776 KB Output is correct
57 Correct 1904 ms 433576 KB Output is correct
58 Correct 1936 ms 432592 KB Output is correct
59 Correct 1798 ms 429604 KB Output is correct
60 Correct 2111 ms 433608 KB Output is correct
61 Correct 464 ms 364400 KB Output is correct
62 Correct 1480 ms 423788 KB Output is correct
63 Correct 1988 ms 433660 KB Output is correct
64 Correct 2274 ms 440848 KB Output is correct
65 Correct 2338 ms 444856 KB Output is correct
66 Correct 2079 ms 437868 KB Output is correct
67 Correct 576 ms 367440 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 338 ms 352732 KB Output is correct
2 Correct 335 ms 352632 KB Output is correct
3 Correct 338 ms 352760 KB Output is correct
4 Correct 340 ms 352644 KB Output is correct
5 Correct 365 ms 352832 KB Output is correct
6 Correct 384 ms 353136 KB Output is correct
7 Correct 402 ms 352864 KB Output is correct
8 Correct 392 ms 353140 KB Output is correct
9 Correct 375 ms 353108 KB Output is correct
10 Correct 363 ms 353352 KB Output is correct
11 Correct 399 ms 352988 KB Output is correct
12 Correct 377 ms 353040 KB Output is correct
13 Correct 393 ms 352848 KB Output is correct
14 Correct 350 ms 353032 KB Output is correct
15 Correct 374 ms 353140 KB Output is correct
16 Correct 379 ms 353040 KB Output is correct
17 Correct 381 ms 353120 KB Output is correct
18 Correct 369 ms 353116 KB Output is correct
19 Correct 340 ms 353016 KB Output is correct
20 Correct 339 ms 353144 KB Output is correct
21 Correct 338 ms 352716 KB Output is correct
22 Correct 356 ms 353116 KB Output is correct
23 Correct 343 ms 353144 KB Output is correct
24 Correct 337 ms 353196 KB Output is correct
25 Correct 349 ms 353076 KB Output is correct
26 Correct 351 ms 353192 KB Output is correct
27 Correct 367 ms 352904 KB Output is correct
28 Correct 343 ms 353016 KB Output is correct
29 Correct 345 ms 352876 KB Output is correct
30 Correct 356 ms 352908 KB Output is correct
31 Correct 3408 ms 462252 KB Output is correct
32 Correct 503 ms 364380 KB Output is correct
33 Correct 2844 ms 466424 KB Output is correct
34 Correct 3155 ms 464776 KB Output is correct
35 Correct 2885 ms 462956 KB Output is correct
36 Correct 2827 ms 463372 KB Output is correct
37 Correct 2281 ms 457724 KB Output is correct
38 Correct 2136 ms 458120 KB Output is correct
39 Correct 1582 ms 442592 KB Output is correct
40 Correct 1773 ms 446492 KB Output is correct
41 Correct 2079 ms 434624 KB Output is correct
42 Correct 1962 ms 435568 KB Output is correct
43 Correct 442 ms 364200 KB Output is correct
44 Correct 1908 ms 433536 KB Output is correct
45 Correct 1790 ms 428496 KB Output is correct
46 Correct 1535 ms 419136 KB Output is correct
47 Correct 1203 ms 413872 KB Output is correct
48 Correct 1111 ms 412880 KB Output is correct
49 Correct 1228 ms 420908 KB Output is correct
50 Correct 1424 ms 430540 KB Output is correct
51 Correct 1233 ms 418456 KB Output is correct
52 Execution timed out 5045 ms 577200 KB Time limit exceeded
53 Halted 0 ms 0 KB -