답안 #141543

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
141543 2019-08-08T10:55:47 Z Bodo171 Meetings (JOI19_meetings) C++14
100 / 100
1806 ms 940 KB
#include "meetings.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cstdlib>
using namespace std;
int A;
bool cmp(int x,int y)
{
    return (Query(A,x,y)==x);
}
void ss(int x,int y)
{
    if(x>y) swap(x,y);
    Bridge(x,y);
}
void solve(vector<int> v,int rad)
{
    vector<int> path,aux;
    vector< pair<int,int> > out;
    if(v.empty()) return;
    if(v.size()==1)
    {
        ss(rad,v[0]);
        return;
    }
    int nod=v[rand()%v.size()],x;
    for(int i=0;i<v.size();i++)
        if(v[i]!=nod)
    {
        x=Query(rad,nod,v[i]);
        if(x==v[i]) path.push_back(v[i]);
        else out.push_back({x,v[i]});
    }
    A=rad;
    if(path.size())
   {
    sort(path.begin(),path.end(),cmp);
    ss(rad,path[0]);
    ss(path.back(),nod);
    for(int i=0;i+1<path.size();i++)
        ss(path[i],path[i+1]);
   }
   else ss(rad,nod);
    sort(out.begin(),out.end());
    int j=0;
    for(int i=0;i<out.size();i++)
    {
        aux.resize(0);
        while(j<out.size()&&out[i].first==out[j].first)
        {
            aux.push_back(out[j].second);
            j++;
        }
        solve(aux,out[i].first);
        i=j-1;
    }

}
void Solve(int N) {
  srand(time(NULL));
  vector<int> ini;
  for(int i=1;i<N;i++)
    ini.push_back(i);
  solve(ini,0);
}

Compilation message

meetings.cpp: In function 'void solve(std::vector<int>, int)':
meetings.cpp:29:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v.size();i++)
                 ~^~~~~~~~~
meetings.cpp:42:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i+1<path.size();i++)
                 ~~~^~~~~~~~~~~~
meetings.cpp:48:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<out.size();i++)
                 ~^~~~~~~~~~~
meetings.cpp:51:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(j<out.size()&&out[i].first==out[j].first)
               ~^~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 248 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 248 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 248 KB Output is correct
11 Correct 2 ms 252 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 248 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 248 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 248 KB Output is correct
11 Correct 2 ms 252 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 252 KB Output is correct
16 Correct 2 ms 248 KB Output is correct
17 Correct 2 ms 296 KB Output is correct
18 Correct 2 ms 248 KB Output is correct
19 Correct 2 ms 248 KB Output is correct
20 Correct 2 ms 248 KB Output is correct
21 Correct 2 ms 276 KB Output is correct
22 Correct 2 ms 252 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 248 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 248 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 248 KB Output is correct
11 Correct 2 ms 252 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 252 KB Output is correct
16 Correct 2 ms 248 KB Output is correct
17 Correct 2 ms 296 KB Output is correct
18 Correct 2 ms 248 KB Output is correct
19 Correct 2 ms 248 KB Output is correct
20 Correct 2 ms 248 KB Output is correct
21 Correct 2 ms 276 KB Output is correct
22 Correct 2 ms 252 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 7 ms 376 KB Output is correct
28 Correct 7 ms 376 KB Output is correct
29 Correct 6 ms 376 KB Output is correct
30 Correct 7 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 9 ms 532 KB Output is correct
33 Correct 14 ms 504 KB Output is correct
34 Correct 18 ms 376 KB Output is correct
35 Correct 15 ms 376 KB Output is correct
36 Correct 6 ms 376 KB Output is correct
37 Correct 14 ms 380 KB Output is correct
38 Correct 10 ms 508 KB Output is correct
39 Correct 12 ms 428 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 635 ms 888 KB Output is correct
2 Correct 702 ms 760 KB Output is correct
3 Correct 751 ms 760 KB Output is correct
4 Correct 717 ms 748 KB Output is correct
5 Correct 323 ms 788 KB Output is correct
6 Correct 354 ms 632 KB Output is correct
7 Correct 627 ms 888 KB Output is correct
8 Correct 781 ms 920 KB Output is correct
9 Correct 835 ms 936 KB Output is correct
10 Correct 766 ms 908 KB Output is correct
11 Correct 865 ms 896 KB Output is correct
12 Correct 469 ms 904 KB Output is correct
13 Correct 275 ms 704 KB Output is correct
14 Correct 430 ms 820 KB Output is correct
15 Correct 459 ms 632 KB Output is correct
16 Correct 569 ms 820 KB Output is correct
17 Correct 892 ms 900 KB Output is correct
18 Correct 466 ms 808 KB Output is correct
19 Correct 479 ms 716 KB Output is correct
20 Correct 502 ms 760 KB Output is correct
21 Correct 561 ms 840 KB Output is correct
22 Correct 534 ms 868 KB Output is correct
23 Correct 524 ms 760 KB Output is correct
24 Correct 495 ms 744 KB Output is correct
25 Correct 515 ms 884 KB Output is correct
26 Correct 606 ms 716 KB Output is correct
27 Correct 623 ms 832 KB Output is correct
28 Correct 940 ms 916 KB Output is correct
29 Correct 750 ms 844 KB Output is correct
30 Correct 742 ms 760 KB Output is correct
31 Correct 846 ms 884 KB Output is correct
32 Correct 1806 ms 940 KB Output is correct
33 Correct 577 ms 760 KB Output is correct
34 Correct 6 ms 376 KB Output is correct
35 Correct 6 ms 376 KB Output is correct
36 Correct 7 ms 376 KB Output is correct
37 Correct 6 ms 376 KB Output is correct
38 Correct 6 ms 424 KB Output is correct
39 Correct 9 ms 376 KB Output is correct
40 Correct 13 ms 376 KB Output is correct
41 Correct 17 ms 504 KB Output is correct
42 Correct 15 ms 376 KB Output is correct
43 Correct 6 ms 296 KB Output is correct
44 Correct 13 ms 508 KB Output is correct
45 Correct 14 ms 504 KB Output is correct
46 Correct 13 ms 504 KB Output is correct
47 Correct 2 ms 248 KB Output is correct
48 Correct 2 ms 248 KB Output is correct
49 Correct 2 ms 248 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 2 ms 248 KB Output is correct
53 Correct 2 ms 248 KB Output is correct
54 Correct 2 ms 376 KB Output is correct
55 Correct 2 ms 248 KB Output is correct
56 Correct 2 ms 248 KB Output is correct
57 Correct 2 ms 376 KB Output is correct
58 Correct 2 ms 248 KB Output is correct
59 Correct 2 ms 376 KB Output is correct
60 Correct 2 ms 248 KB Output is correct
61 Correct 2 ms 248 KB Output is correct
62 Correct 2 ms 248 KB Output is correct
63 Correct 2 ms 376 KB Output is correct
64 Correct 2 ms 376 KB Output is correct
65 Correct 2 ms 380 KB Output is correct
66 Correct 2 ms 248 KB Output is correct
67 Correct 2 ms 252 KB Output is correct
68 Correct 2 ms 248 KB Output is correct
69 Correct 2 ms 376 KB Output is correct
70 Correct 2 ms 248 KB Output is correct
71 Correct 2 ms 248 KB Output is correct
72 Correct 2 ms 248 KB Output is correct