QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#385706#5111. Take On MemeSolitaryDreamWA 74ms29852kbC++173.2kb2024-04-11 00:04:552024-04-11 00:04:55

Judging History

你现在查看的是最新测评结果

  • [2024-04-11 00:04:55]
  • 评测
  • 测评结果:WA
  • 用时:74ms
  • 内存:29852kb
  • [2024-04-11 00:04:55]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fs first
#define sd second
const int N=1e4+1e3+7;
struct P {
    int x, y, id;
};
int operator *(const P &a,const P &b)
{
    return a.x*b.y-a.y*b.x;
}
bool operator <(const P &a,const P &b)
{
    int da=a.x>0||(a.x==0&&a.y>0),db=b.x>0||(b.x==0&&b.y>0);
    if(da!=db)
        return da>db;
    return a*b>0;
}
using cv=pair<P, vector<P> >;
cv f[N];
P operator -(const P &a)
{
    return {-a.x,-a.y};
}
P operator -(const P &a,const P &b)
{
    return {a.x-b.x,a.y-b.y};
}
P operator +(const P &a,const P &b)
{
    return {a.x+b.x,a.y+b.y};
}
// cv operator +(const cv &a,const cv &b)
// {

// }
int n;
vector<int> g[N];
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int k;
        cin>>k;
        if(k)
        {
            while(k--)
            {
                int a;
                cin>>a;
                g[i].push_back(a);
            }
        }
        else
        {
            cin>>f[i].fs.x>>f[i].fs.y;
            // f[i].sd.push_back({0,0,i});
        }
    }
    for(int i=n;i>=1;i--)
    {
        if(!g[i].size())
            continue;
        vector<P> all;
        cv tmp;
        for(auto v:g[i])
        {
            tmp.fs=tmp.fs+f[v].fs;
            for(auto p:f[v].sd)
                tmp.sd.push_back(p);
        }
        sort(tmp.sd.begin(),tmp.sd.end());
        for(auto v:g[i])
        {
            vector<P> tv;
            P base=-(tmp.fs-f[v].fs);
            for(auto p:tmp.sd)
                if(p.id!=v)
                {
                    tv.push_back(-p);
                    if(p.x>0||(p.x==0&&p.y>0))
                        base=base-p;
                }
            base=base+f[v].fs;
            int m=tv.size();
            for(auto q:f[v].sd)
                tv.push_back(q);
            sort(tv.begin(),tv.end());
            // inplace_merge(tv.begin(),tv.begin()+m,tv.end());
            all.push_back(base);
            for(auto x:tv)
                base=base+x,all.push_back(base);
        }
        sort(all.begin(),all.end(),[&](const P &a,const P &b){return a.x<b.x||(a.x==b.x&&a.y<b.y);});
        vector<P> st;
        for(auto p:all)
        {
            while(st.size()>1&&(p-st.end()[-2])*(st.back()-st.end()[-2])>=0)
                st.pop_back();
            st.push_back(p);
        }
        int k=st.size();
        reverse(all.begin(),all.end());
        for(auto p:all)
        {
            while(st.size()>k&&(p-st.end()[-2])*(st.back()-st.end()[-2])>=0)
                st.pop_back();
            st.push_back(p);
        }
        st.pop_back();
        f[i].first=st[0];
        for(int t=0;t<st.size();t++)
        {
            f[i].sd.push_back(st[(t+1)%st.size()]-st[t]);
        }
        sort(f[i].sd.begin(),f[i].sd.end());
        for(auto &p:f[i].sd)
            p.id=i;
    }
    int ans=0;
    P base=f[1].fs;
        ans=max(ans,base.x*base.x+base.y*base.y);
    for(auto x:f[1].sd)
    {
        base=base+x;
        ans=max(ans,base.x*base.x+base.y*base.y);
    }
    cout<<ans<<"\n";
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 4580kb

input:

5
4 2 3 4 5
0 2 -2
0 1 3
0 4 -6
0 -18 5

output:

725

result:

ok single line: '725'

Test #2:

score: 0
Accepted
time: 1ms
memory: 4660kb

input:

5
2 2 3
2 4 5
0 1 5
0 -4 -6
0 -1 7

output:

340

result:

ok single line: '340'

Test #3:

score: 0
Accepted
time: 0ms
memory: 4300kb

input:

18
3 4 3 2
2 5 6
3 7 9 8
3 10 11 12
0 4 -1
0 18 49
0 -2 10
2 13 14
0 -5 6
0 5 8
4 15 16 17 18
0 17 3
0 3 -9
0 -7 -1
0 14 -33
0 -23 11
0 11 14
0 2 19

output:

26269

result:

ok single line: '26269'

Test #4:

score: 0
Accepted
time: 58ms
memory: 17556kb

input:

10000
59 2 171 340 509 678 847 1016 1185 1382 1551 1720 1889 2058 2227 2396 2565 2734 2903 3072 3241 3410 3579 3748 3917 4086 4255 4424 4593 4762 4931 5100 5269 5438 5607 5776 5945 6114 6283 6452 6621 6790 6959 7128 7297 7466 7635 7804 7973 8142 8311 8480 8649 8818 8987 9156 9325 9494 9663 9832
2 3 ...

output:

4893524000116

result:

ok single line: '4893524000116'

Test #5:

score: 0
Accepted
time: 63ms
memory: 11576kb

input:

10000
37 2 272 542 812 1082 1352 1622 1892 2162 2432 2702 2972 3242 3512 3782 4052 4322 4592 4862 5132 5402 5672 5942 6212 6482 6752 7022 7292 7571 7841 8111 8381 8651 8921 9191 9461 9731
51 3 8 13 18 23 42 47 52 57 62 67 72 77 82 87 92 97 102 107 112 117 122 127 132 137 142 147 152 157 162 167 172 ...

output:

5186192629829

result:

ok single line: '5186192629829'

Test #6:

score: 0
Accepted
time: 74ms
memory: 29852kb

input:

10000
89 2 114 226 338 450 562 674 786 898 1010 1122 1234 1346 1458 1570 1682 1794 1906 2018 2130 2242 2354 2466 2578 2690 2802 2914 3026 3138 3250 3362 3474 3586 3698 3810 3922 4034 4146 4258 4370 4482 4594 4706 4818 4930 5042 5154 5266 5378 5490 5602 5714 5826 5938 6050 6162 6274 6386 6498 6610 67...

output:

5143217930845

result:

ok single line: '5143217930845'

Test #7:

score: 0
Accepted
time: 0ms
memory: 4580kb

input:

1
0 0 0

output:

0

result:

ok single line: '0'

Test #8:

score: 0
Accepted
time: 1ms
memory: 4352kb

input:

1
0 -1000 0

output:

1000000

result:

ok single line: '1000000'

Test #9:

score: 0
Accepted
time: 1ms
memory: 4640kb

input:

1
0 0 -1000

output:

1000000

result:

ok single line: '1000000'

Test #10:

score: 0
Accepted
time: 1ms
memory: 4648kb

input:

1
0 -1000 1000

output:

2000000

result:

ok single line: '2000000'

Test #11:

score: 0
Accepted
time: 1ms
memory: 4412kb

input:

2
1 2
0 0 0

output:

0

result:

ok single line: '0'

Test #12:

score: 0
Accepted
time: 1ms
memory: 4408kb

input:

2
1 2
0 -123 -456

output:

223065

result:

ok single line: '223065'

Test #13:

score: 0
Accepted
time: 1ms
memory: 4452kb

input:

3
2 2 3
0 123 456
0 123 456

output:

0

result:

ok single line: '0'

Test #14:

score: 0
Accepted
time: 0ms
memory: 4448kb

input:

3
2 2 3
0 -123 456
0 123 456

output:

60516

result:

ok single line: '60516'

Test #15:

score: 0
Accepted
time: 1ms
memory: 4648kb

input:

3
2 2 3
0 123 456
0 123 -456

output:

831744

result:

ok single line: '831744'

Test #16:

score: 0
Accepted
time: 0ms
memory: 4448kb

input:

3
2 2 3
0 -123 456
0 123 -456

output:

892260

result:

ok single line: '892260'

Test #17:

score: 0
Accepted
time: 1ms
memory: 4408kb

input:

3
2 2 3
0 -123 456
0 345 678

output:

268308

result:

ok single line: '268308'

Test #18:

score: 0
Accepted
time: 1ms
memory: 4380kb

input:

3
1 2
1 3
0 -123 -456

output:

223065

result:

ok single line: '223065'

Test #19:

score: 0
Accepted
time: 1ms
memory: 4388kb

input:

4
3 2 3 4
0 1 0
0 1 0
0 1 0

output:

1

result:

ok single line: '1'

Test #20:

score: 0
Accepted
time: 1ms
memory: 4344kb

input:

6
2 2 3
3 4 5 6
0 1 0
0 1 0
0 1 0
0 1 0

output:

4

result:

ok single line: '4'

Test #21:

score: 0
Accepted
time: 1ms
memory: 4388kb

input:

6
2 2 3
3 4 5 6
0 -1 0
0 1 0
0 1 0
0 1 0

output:

0

result:

ok single line: '0'

Test #22:

score: 0
Accepted
time: 1ms
memory: 4348kb

input:

9
2 2 3
3 4 5 6
3 7 8 9
0 1 0
0 1 0
0 1 0
0 1 0
0 1 0
0 1 0

output:

0

result:

ok single line: '0'

Test #23:

score: 0
Accepted
time: 1ms
memory: 4580kb

input:

11
2 2 3
3 5 6 7
2 4 8
3 9 10 11
0 1 0
0 1 0
0 1 0
0 0 0
0 1 0
0 1 0
0 1 0

output:

4

result:

ok single line: '4'

Test #24:

score: 0
Accepted
time: 1ms
memory: 4648kb

input:

7
2 2 3
4 4 5 6 7
0 -1 1
0 1 0
0 0 1
0 -1 0
0 0 -1

output:

10

result:

ok single line: '10'

Test #25:

score: 0
Accepted
time: 1ms
memory: 4392kb

input:

11
10 2 3 4 5 6 7 8 9 10 11
0 102 -967
0 986 -21
0 709 -570
0 -987 -692
0 571 -682
0 -926 -89
0 -872 600
0 137 -79
0 -844 100
0 -171 359

output:

14669290

result:

ok single line: '14669290'

Test #26:

score: 0
Accepted
time: 1ms
memory: 4456kb

input:

111
10 2 13 24 35 46 57 68 79 90 101
10 3 4 5 6 7 8 9 10 11 12
0 802 -636
0 314 100
0 854 515
0 564 -305
0 905 -624
0 -145 -402
0 -342 828
0 -589 776
0 -51 163
0 929 58
10 14 15 16 17 18 19 20 21 22 23
0 321 177
0 497 -114
0 905 -669
0 987 301
0 754 -48
0 594 861
0 -76 -2
0 -450 -850
0 -428 286
0 83...

output:

943392365

result:

ok single line: '943392365'

Test #27:

score: 0
Accepted
time: 2ms
memory: 4884kb

input:

1111
10 2 113 224 335 446 557 668 779 890 1001
10 3 14 25 36 47 58 69 80 91 102
10 4 5 6 7 8 9 10 11 12 13
0 -846 43
0 794 332
0 -558 -43
0 -642 -438
0 -245 936
0 -289 489
0 -643 211
0 876 -116
0 -743 290
0 -411 587
10 15 16 17 18 19 20 21 22 23 24
0 -458 -210
0 -967 244
0 -220 -827
0 632 -261
0 970...

output:

66275717341

result:

ok single line: '66275717341'

Test #28:

score: 0
Accepted
time: 9ms
memory: 6428kb

input:

7381
9 2 822 1642 2462 3282 4102 4922 5742 6562
9 3 94 185 276 367 458 549 640 731
9 4 14 24 34 44 54 64 74 84
9 5 6 7 8 9 10 11 12 13
0 -644 -151
0 -950 349
0 344 145
0 161 -819
0 571 303
0 481 531
0 -644 105
0 821 802
0 -697 909
9 15 16 17 18 19 20 21 22 23
0 -421 -543
0 -816 889
0 773 -254
0 -219...

output:

3021509835725

result:

ok single line: '3021509835725'

Test #29:

score: 0
Accepted
time: 16ms
memory: 7024kb

input:

9331
6 2 1557 3112 4667 6222 7777
6 3 262 521 780 1039 1298
6 4 47 90 133 176 219
6 5 12 19 26 33 40
6 6 7 8 9 10 11
0 -236 -302
0 39 410
0 -424 -529
0 107 319
0 -705 -271
0 9 52
6 13 14 15 16 17 18
0 -385 -363
0 -271 -170
0 611 507
0 283 -357
0 582 -994
0 687 -118
6 20 21 22 23 24 25
0 -338 394
0 -...

output:

7634291710385

result:

ok single line: '7634291710385'

Test #30:

score: 0
Accepted
time: 14ms
memory: 7320kb

input:

9901
99 2 102 202 302 402 502 602 702 802 902 1002 1102 1202 1302 1402 1502 1602 1702 1802 1902 2002 2102 2202 2302 2402 2502 2602 2702 2802 2902 3002 3102 3202 3302 3402 3502 3602 3702 3802 3902 4002 4102 4202 4302 4402 4502 4602 4702 4802 4902 5002 5102 5202 5302 5402 5502 5602 5702 5802 5902 6002...

output:

118831327360

result:

ok single line: '118831327360'

Test #31:

score: 0
Accepted
time: 6ms
memory: 7200kb

input:

9901
99 2 102 202 302 402 502 602 702 802 902 1002 1102 1202 1302 1402 1502 1602 1702 1802 1902 2002 2102 2202 2302 2402 2502 2602 2702 2802 2902 3002 3102 3202 3302 3402 3502 3602 3702 3802 3902 4002 4102 4202 4302 4402 4502 4602 4702 4802 4902 5002 5102 5202 5302 5402 5502 5602 5702 5802 5902 6002...

output:

15242981

result:

ok single line: '15242981'

Test #32:

score: 0
Accepted
time: 3ms
memory: 4788kb

input:

2047
2 2 1025
2 3 514
2 4 259
2 5 132
2 6 69
2 7 38
2 8 23
2 9 16
2 10 13
2 11 12
0 -188 -675
0 91 843
2 14 15
0 -818 -711
0 681 150
2 17 20
2 18 19
0 803 -178
0 338 49
2 21 22
0 -835 214
0 -871 -234
2 24 31
2 25 28
2 26 27
0 -505 660
0 999 -590
2 29 30
0 19 -850
0 -177 -612
2 32 35
2 33 34
0 788 6
...

output:

126635786164

result:

ok single line: '126635786164'

Test #33:

score: 0
Accepted
time: 16ms
memory: 7900kb

input:

9841
3 2 3282 6562
3 3 1096 2189
3 4 368 732
3 5 126 247
3 6 46 86
3 7 20 33
3 8 12 16
3 9 10 11
0 701 -507
0 -195 959
0 -669 -826
3 13 14 15
0 -410 -801
0 243 684
0 466 505
3 17 18 19
0 916 777
0 704 957
0 -885 -437
3 21 25 29
3 22 23 24
0 633 797
0 -155 961
0 -211 786
3 26 27 28
0 378 344
0 833 -4...

output:

8732559067380

result:

ok single line: '8732559067380'

Test #34:

score: -100
Wrong Answer
time: 6ms
memory: 5080kb

input:

9841
3 2 3282 6562
3 3 1096 2189
3 4 368 732
3 5 126 247
3 6 46 86
3 7 20 33
3 8 12 16
3 9 10 11
0 1 1
0 1 0
0 1 1
3 13 14 15
0 0 0
0 -1 -1
0 1 -1
3 17 18 19
0 1 0
0 0 1
0 -1 0
3 21 25 29
3 22 23 24
0 0 0
0 -1 -1
0 0 -1
3 26 27 28
0 1 0
0 0 1
0 1 1
3 30 31 32
0 1 1
0 0 0
0 0 1
3 34 38 42
3 35 36 37
...

output:

17106770

result:

wrong answer 1st lines differ - expected: '17115530', found: '17106770'