oj.uz

답안 #171248

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
171248 2019-12-28T05:06:16 Z arnold518 새 집 (APIO18_new_home) C++14
47 / 100
 5000 ms 587948 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#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); }
    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];

vector<Line> lcomp;

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

void pushLine1(int x, int y)
{
    Line p=Line1(x, y);
    lcomp.push_back(p);
}

void pushLine2(int x, int y)
{
    Line p=Line2(x, y);
    lcomp.push_back(p);
}

int f(Line t) { return lower_bound(lcomp.begin(), lcomp.end(), t)-lcomp.begin(); }

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

vector<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);
    int q=f(p);
    if(M1[q].second==0) M1[q].first=t;
    M1[q].second++;
}

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

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

vector<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);
    int q=f(p);
    if(M2[q].second==0) M2[q].first=t;
    M2[q].second++;
}

void popLine2(int x, int y, int t)
{
    Line p=Line2(x, y);
    int q=f(p);
    M2[q].second--;
    if(M2[q].second==0) update2(1, 1, C, M2[q].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;

    auto begin = chrono::high_resolution_clock::now();
    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);
                    pushLine2(x, INF);
                }
                else
                {
                    auto it=S[t].lower_bound(x);
                    int l, r;
                    if(it==S[t].end())
                    {
                        l=*prev(it);
                        pushLine2(l, l+x>>1);
                        pushLine1(l+x>>1, x);
                        pushLine2(x, INF);
                    }
                    else if(it==S[t].begin())
                    {
                        r=*it;
                        pushLine1(0, x);
                        pushLine2(x, r+x>>1);
                        pushLine1(r+x>>1, r);
                    }
                    else
                    {
                        r=*it, l=*prev(it);
                        pushLine2(l, l+x>>1);
                        pushLine1(l+x>>1, x);
                        pushLine2(x, x+r>>1);
                        pushLine1(x+r>>1, r);
                    }
                }
            }
            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);
                else
                {
                    auto it=S[t].lower_bound(x);
                    int l, r;
                    if(it==S[t].end())
                    {
                        l=*prev(it);
                        pushLine2(l, INF);
                    }
                    else if(it==S[t].begin())
                    {
                        r=*it;
                        pushLine1(0, r);
                    }
                    else
                    {
                        r=*it, l=*prev(it);
                        pushLine2(l, l+r>>1);
                        pushLine1(l+r>>1, r);
                    }
                }
            }
        }
    }
    sort(lcomp.begin(), lcomp.end());
    lcomp.erase(unique(lcomp.begin(), lcomp.end()), lcomp.end());
    M1.resize(lcomp.size());
    M2.resize(lcomp.size());

    auto  end = chrono::high_resolution_clock::now();
    if(chrono::duration_cast<chrono::nanoseconds>(end-begin).count()>=4e9) assert(0);


    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:66: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:96: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:126: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:135: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:163:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0, j=0; i<tree3[node].size(); i++)
                   ~^~~~~~~~~~~~~~~~~~~
new_home.cpp:166: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:180:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0, j=0; i<tree3[node].size(); i++)
                   ~^~~~~~~~~~~~~~~~~~~
new_home.cpp:183: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:204:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
new_home.cpp: In function 'int main()':
new_home.cpp:271:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(l, l+x>>1);
                                      ~^~
new_home.cpp:272:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(l+x>>1, x);
                                   ~^~
new_home.cpp:279:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(x, r+x>>1);
                                      ~^~
new_home.cpp:280:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(r+x>>1, r);
                                   ~^~
new_home.cpp:285:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(l, l+x>>1);
                                      ~^~
new_home.cpp:286:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(l+x>>1, x);
                                   ~^~
new_home.cpp:287:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(x, x+r>>1);
                                      ~^~
new_home.cpp:288:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(x+r>>1, r);
                                   ~^~
new_home.cpp:317:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(l, l+r>>1);
                                      ~^~
new_home.cpp:318:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(l+r>>1, r);
                                   ~^~
new_home.cpp:252:19: warning: variable 'a' set but not used [-Wunused-but-set-variable]
         int x, t, a, b;
                   ^
new_home.cpp:356:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(l, l+x>>1, a);
                                      ~^~
new_home.cpp:357:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(l+x>>1, x, a);
                                   ~^~
new_home.cpp:365:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(x, r+x>>1, a);
                                      ~^~
new_home.cpp:366:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(r+x>>1, r, a);
                                   ~^~
new_home.cpp:371:38: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine2(l, l+r>>1, a);
                                     ~^~
new_home.cpp:372:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine1(l+r>>1, r, a);
                                  ~^~
new_home.cpp:373:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(l, l+x>>1, a);
                                      ~^~
new_home.cpp:374:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(l+x>>1, x, a);
                                   ~^~
new_home.cpp:375:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(x, x+r>>1, a);
                                      ~^~
new_home.cpp:376:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(x+r>>1, r, a);
                                   ~^~
new_home.cpp:400:38: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine2(l, l+x>>1, a);
                                     ~^~
new_home.cpp:401:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine1(l+x>>1, x, a);
                                  ~^~
new_home.cpp:409:38: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine2(x, r+x>>1, a);
                                     ~^~
new_home.cpp:410:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine1(r+x>>1, r, a);
                                  ~^~
new_home.cpp:415:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine2(l, l+r>>1, a);
                                      ~^~
new_home.cpp:416:36: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         pushLine1(l+r>>1, r, a);
                                   ~^~
new_home.cpp:417:38: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine2(l, l+x>>1, a);
                                     ~^~
new_home.cpp:418:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine1(l+x>>1, x, a);
                                  ~^~
new_home.cpp:419:38: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine2(x, x+r>>1, a);
                                     ~^~
new_home.cpp:420:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
                         popLine1(x+r>>1, r, a);
                                  ~^~
new_home.cpp:217:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
new_home.cpp:220: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:224: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:233: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 353 ms 352632 KB Output is correct
2 Correct 355 ms 352672 KB Output is correct
3 Correct 354 ms 352632 KB Output is correct
4 Correct 353 ms 352596 KB Output is correct
5 Correct 353 ms 352660 KB Output is correct
6 Correct 363 ms 353064 KB Output is correct
7 Correct 361 ms 352888 KB Output is correct
8 Correct 358 ms 352988 KB Output is correct
9 Correct 356 ms 352988 KB Output is correct
10 Correct 361 ms 353016 KB Output is correct
11 Correct 380 ms 353028 KB Output is correct
12 Correct 360 ms 352860 KB Output is correct
13 Correct 359 ms 352948 KB Output is correct
14 Correct 357 ms 352864 KB Output is correct
15 Correct 378 ms 353016 KB Output is correct
16 Correct 419 ms 352984 KB Output is correct
17 Correct 416 ms 352916 KB Output is correct
18 Correct 416 ms 353060 KB Output is correct
19 Correct 411 ms 352948 KB Output is correct
20 Correct 358 ms 353016 KB Output is correct
21 Correct 361 ms 352892 KB Output is correct
22 Correct 359 ms 352888 KB Output is correct
23 Correct 527 ms 352888 KB Output is correct
24 Correct 425 ms 352888 KB Output is correct
25 Correct 408 ms 352964 KB Output is correct
26 Correct 357 ms 352888 KB Output is correct
27 Correct 407 ms 353004 KB Output is correct
28 Correct 358 ms 352980 KB Output is correct
29 Correct 363 ms 352996 KB Output is correct
30 Correct 355 ms 352816 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 353 ms 352632 KB Output is correct
2 Correct 355 ms 352672 KB Output is correct
3 Correct 354 ms 352632 KB Output is correct
4 Correct 353 ms 352596 KB Output is correct
5 Correct 353 ms 352660 KB Output is correct
6 Correct 363 ms 353064 KB Output is correct
7 Correct 361 ms 352888 KB Output is correct
8 Correct 358 ms 352988 KB Output is correct
9 Correct 356 ms 352988 KB Output is correct
10 Correct 361 ms 353016 KB Output is correct
11 Correct 380 ms 353028 KB Output is correct
12 Correct 360 ms 352860 KB Output is correct
13 Correct 359 ms 352948 KB Output is correct
14 Correct 357 ms 352864 KB Output is correct
15 Correct 378 ms 353016 KB Output is correct
16 Correct 419 ms 352984 KB Output is correct
17 Correct 416 ms 352916 KB Output is correct
18 Correct 416 ms 353060 KB Output is correct
19 Correct 411 ms 352948 KB Output is correct
20 Correct 358 ms 353016 KB Output is correct
21 Correct 361 ms 352892 KB Output is correct
22 Correct 359 ms 352888 KB Output is correct
23 Correct 527 ms 352888 KB Output is correct
24 Correct 425 ms 352888 KB Output is correct
25 Correct 408 ms 352964 KB Output is correct
26 Correct 357 ms 352888 KB Output is correct
27 Correct 407 ms 353004 KB Output is correct
28 Correct 358 ms 352980 KB Output is correct
29 Correct 363 ms 352996 KB Output is correct
30 Correct 355 ms 352816 KB Output is correct
31 Correct 2528 ms 443888 KB Output is correct
32 Correct 523 ms 363240 KB Output is correct
33 Correct 2608 ms 448148 KB Output is correct
34 Correct 2566 ms 446836 KB Output is correct
35 Correct 2628 ms 444336 KB Output is correct
36 Correct 2688 ms 444496 KB Output is correct
37 Correct 1839 ms 439524 KB Output is correct
38 Correct 1777 ms 439528 KB Output is correct
39 Correct 1459 ms 424288 KB Output is correct
40 Correct 1609 ms 428004 KB Output is correct
41 Correct 1543 ms 420056 KB Output is correct
42 Correct 1516 ms 421128 KB Output is correct
43 Correct 472 ms 361952 KB Output is correct
44 Correct 1532 ms 419040 KB Output is correct
45 Correct 1727 ms 413916 KB Output is correct
46 Correct 1181 ms 404688 KB Output is correct
47 Correct 918 ms 401384 KB Output is correct
48 Correct 940 ms 400136 KB Output is correct
49 Correct 1134 ms 407400 KB Output is correct
50 Correct 1375 ms 416660 KB Output is correct
51 Correct 1039 ms 404816 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3998 ms 527616 KB Output is correct
2 Execution timed out 5109 ms 539072 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 353 ms 352632 KB Output is correct
2 Correct 355 ms 352672 KB Output is correct
3 Correct 354 ms 352632 KB Output is correct
4 Correct 353 ms 352596 KB Output is correct
5 Correct 353 ms 352660 KB Output is correct
6 Correct 363 ms 353064 KB Output is correct
7 Correct 361 ms 352888 KB Output is correct
8 Correct 358 ms 352988 KB Output is correct
9 Correct 356 ms 352988 KB Output is correct
10 Correct 361 ms 353016 KB Output is correct
11 Correct 380 ms 353028 KB Output is correct
12 Correct 360 ms 352860 KB Output is correct
13 Correct 359 ms 352948 KB Output is correct
14 Correct 357 ms 352864 KB Output is correct
15 Correct 378 ms 353016 KB Output is correct
16 Correct 419 ms 352984 KB Output is correct
17 Correct 416 ms 352916 KB Output is correct
18 Correct 416 ms 353060 KB Output is correct
19 Correct 411 ms 352948 KB Output is correct
20 Correct 358 ms 353016 KB Output is correct
21 Correct 361 ms 352892 KB Output is correct
22 Correct 359 ms 352888 KB Output is correct
23 Correct 527 ms 352888 KB Output is correct
24 Correct 425 ms 352888 KB Output is correct
25 Correct 408 ms 352964 KB Output is correct
26 Correct 357 ms 352888 KB Output is correct
27 Correct 407 ms 353004 KB Output is correct
28 Correct 358 ms 352980 KB Output is correct
29 Correct 363 ms 352996 KB Output is correct
30 Correct 355 ms 352816 KB Output is correct
31 Correct 2528 ms 443888 KB Output is correct
32 Correct 523 ms 363240 KB Output is correct
33 Correct 2608 ms 448148 KB Output is correct
34 Correct 2566 ms 446836 KB Output is correct
35 Correct 2628 ms 444336 KB Output is correct
36 Correct 2688 ms 444496 KB Output is correct
37 Correct 1839 ms 439524 KB Output is correct
38 Correct 1777 ms 439528 KB Output is correct
39 Correct 1459 ms 424288 KB Output is correct
40 Correct 1609 ms 428004 KB Output is correct
41 Correct 1543 ms 420056 KB Output is correct
42 Correct 1516 ms 421128 KB Output is correct
43 Correct 472 ms 361952 KB Output is correct
44 Correct 1532 ms 419040 KB Output is correct
45 Correct 1727 ms 413916 KB Output is correct
46 Correct 1181 ms 404688 KB Output is correct
47 Correct 918 ms 401384 KB Output is correct
48 Correct 940 ms 400136 KB Output is correct
49 Correct 1134 ms 407400 KB Output is correct
50 Correct 1375 ms 416660 KB Output is correct
51 Correct 1039 ms 404816 KB Output is correct
52 Correct 1652 ms 409556 KB Output is correct
53 Correct 1771 ms 413868 KB Output is correct
54 Correct 1908 ms 429520 KB Output is correct
55 Correct 1493 ms 421268 KB Output is correct
56 Correct 1430 ms 418800 KB Output is correct
57 Correct 1612 ms 420212 KB Output is correct
58 Correct 1521 ms 421536 KB Output is correct
59 Correct 1543 ms 420364 KB Output is correct
60 Correct 1542 ms 421288 KB Output is correct
61 Correct 444 ms 363068 KB Output is correct
62 Correct 1383 ms 416624 KB Output is correct
63 Correct 1699 ms 423724 KB Output is correct
64 Correct 1775 ms 429412 KB Output is correct
65 Correct 1857 ms 432908 KB Output is correct
66 Correct 1552 ms 424112 KB Output is correct
67 Correct 566 ms 368428 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 353 ms 352632 KB Output is correct
2 Correct 355 ms 352672 KB Output is correct
3 Correct 354 ms 352632 KB Output is correct
4 Correct 353 ms 352596 KB Output is correct
5 Correct 353 ms 352660 KB Output is correct
6 Correct 363 ms 353064 KB Output is correct
7 Correct 361 ms 352888 KB Output is correct
8 Correct 358 ms 352988 KB Output is correct
9 Correct 356 ms 352988 KB Output is correct
10 Correct 361 ms 353016 KB Output is correct
11 Correct 380 ms 353028 KB Output is correct
12 Correct 360 ms 352860 KB Output is correct
13 Correct 359 ms 352948 KB Output is correct
14 Correct 357 ms 352864 KB Output is correct
15 Correct 378 ms 353016 KB Output is correct
16 Correct 419 ms 352984 KB Output is correct
17 Correct 416 ms 352916 KB Output is correct
18 Correct 416 ms 353060 KB Output is correct
19 Correct 411 ms 352948 KB Output is correct
20 Correct 358 ms 353016 KB Output is correct
21 Correct 361 ms 352892 KB Output is correct
22 Correct 359 ms 352888 KB Output is correct
23 Correct 527 ms 352888 KB Output is correct
24 Correct 425 ms 352888 KB Output is correct
25 Correct 408 ms 352964 KB Output is correct
26 Correct 357 ms 352888 KB Output is correct
27 Correct 407 ms 353004 KB Output is correct
28 Correct 358 ms 352980 KB Output is correct
29 Correct 363 ms 352996 KB Output is correct
30 Correct 355 ms 352816 KB Output is correct
31 Correct 2528 ms 443888 KB Output is correct
32 Correct 523 ms 363240 KB Output is correct
33 Correct 2608 ms 448148 KB Output is correct
34 Correct 2566 ms 446836 KB Output is correct
35 Correct 2628 ms 444336 KB Output is correct
36 Correct 2688 ms 444496 KB Output is correct
37 Correct 1839 ms 439524 KB Output is correct
38 Correct 1777 ms 439528 KB Output is correct
39 Correct 1459 ms 424288 KB Output is correct
40 Correct 1609 ms 428004 KB Output is correct
41 Correct 1543 ms 420056 KB Output is correct
42 Correct 1516 ms 421128 KB Output is correct
43 Correct 472 ms 361952 KB Output is correct
44 Correct 1532 ms 419040 KB Output is correct
45 Correct 1727 ms 413916 KB Output is correct
46 Correct 1181 ms 404688 KB Output is correct
47 Correct 918 ms 401384 KB Output is correct
48 Correct 940 ms 400136 KB Output is correct
49 Correct 1134 ms 407400 KB Output is correct
50 Correct 1375 ms 416660 KB Output is correct
51 Correct 1039 ms 404816 KB Output is correct
52 Correct 3998 ms 527616 KB Output is correct
53 Execution timed out 5109 ms 539072 KB Time limit exceeded
54 Halted 0 ms 0 KB -