oj.uz

Submission #474343

# Submission time Handle Problem Language Result Execution time Memory
474343 2021-09-18T04:01:47 Z NhatMinh0208 Meetings (JOI19_meetings) C++14
100 / 100
 657 ms 864 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif

#include "meetings.h"

vector<int> vec;
int n,m,i,j,k,t,t1,u,v,a,b;

void solveV(vector<int> vec) {
    if (vec.size() == 1) return;
    random_shuffle(vec.begin(), vec.end());
    map<int,vector<int>> lmao;
    lmao[vec[0]].push_back(vec[0]);
    lmao[vec[1]].push_back(vec[1]);
    int u;
    for (int i = 2; i < vec.size(); i++) {
        u = Query(vec[0],vec[1],vec[i]);
        lmao[u].push_back(vec[i]);
    }
    vector<int> line;
    for (auto g : lmao) line.push_back(g.fi);
    sort(line.begin(),line.end(),[&vec](int a, int b){
        if (a==vec[0]) return 1;
        if (b==vec[0]) return 0;
        int u = Query(vec[0],a,b);
        if (u==a) return 1; else return 0;
    });
    for (int i=1;i<line.size();i++) {
        Bridge(min(line[i-1],line[i]),max(line[i-1],line[i]));
    }
    for (int i=0;i<line.size();i++) {
        solveV(lmao[line[i]]);
    }
    
}

void Solve(int N) {
    vector<int> lmao;
    for (int i=0;i<N;i++) {
        lmao.push_back(i);
    }
    solveV(lmao);
}
// N;

Compilation message

meetings.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
meetings.cpp: In function 'void solveV(std::vector<int>)':
meetings.cpp:113:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |     for (int i = 2; i < vec.size(); i++) {
      |                     ~~^~~~~~~~~~~~
meetings.cpp:125:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |     for (int i=1;i<line.size();i++) {
      |                  ~^~~~~~~~~~~~
meetings.cpp:128:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |     for (int i=0;i<line.size();i++) {
      |                  ~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 328 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 0 ms 328 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 328 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 456 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 328 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 328 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 456 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 6 ms 328 KB Output is correct
28 Correct 6 ms 328 KB Output is correct
29 Correct 7 ms 372 KB Output is correct
30 Correct 5 ms 328 KB Output is correct
31 Correct 5 ms 328 KB Output is correct
32 Correct 6 ms 328 KB Output is correct
33 Correct 9 ms 328 KB Output is correct
34 Correct 12 ms 388 KB Output is correct
35 Correct 10 ms 328 KB Output is correct
36 Correct 6 ms 380 KB Output is correct
37 Correct 9 ms 328 KB Output is correct
38 Correct 12 ms 384 KB Output is correct
39 Correct 12 ms 400 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 604 KB Output is correct
2 Correct 493 ms 812 KB Output is correct
3 Correct 530 ms 704 KB Output is correct
4 Correct 473 ms 624 KB Output is correct
5 Correct 399 ms 688 KB Output is correct
6 Correct 425 ms 512 KB Output is correct
7 Correct 480 ms 672 KB Output is correct
8 Correct 525 ms 532 KB Output is correct
9 Correct 525 ms 664 KB Output is correct
10 Correct 556 ms 648 KB Output is correct
11 Correct 611 ms 660 KB Output is correct
12 Correct 436 ms 824 KB Output is correct
13 Correct 360 ms 560 KB Output is correct
14 Correct 372 ms 652 KB Output is correct
15 Correct 435 ms 668 KB Output is correct
16 Correct 389 ms 532 KB Output is correct
17 Correct 534 ms 760 KB Output is correct
18 Correct 371 ms 664 KB Output is correct
19 Correct 375 ms 540 KB Output is correct
20 Correct 401 ms 532 KB Output is correct
21 Correct 552 ms 704 KB Output is correct
22 Correct 429 ms 616 KB Output is correct
23 Correct 504 ms 736 KB Output is correct
24 Correct 475 ms 768 KB Output is correct
25 Correct 482 ms 640 KB Output is correct
26 Correct 472 ms 604 KB Output is correct
27 Correct 478 ms 536 KB Output is correct
28 Correct 657 ms 660 KB Output is correct
29 Correct 453 ms 700 KB Output is correct
30 Correct 587 ms 672 KB Output is correct
31 Correct 591 ms 664 KB Output is correct
32 Correct 596 ms 864 KB Output is correct
33 Correct 445 ms 832 KB Output is correct
34 Correct 6 ms 328 KB Output is correct
35 Correct 6 ms 328 KB Output is correct
36 Correct 6 ms 328 KB Output is correct
37 Correct 5 ms 328 KB Output is correct
38 Correct 4 ms 328 KB Output is correct
39 Correct 7 ms 508 KB Output is correct
40 Correct 9 ms 328 KB Output is correct
41 Correct 10 ms 388 KB Output is correct
42 Correct 10 ms 380 KB Output is correct
43 Correct 7 ms 380 KB Output is correct
44 Correct 9 ms 328 KB Output is correct
45 Correct 11 ms 328 KB Output is correct
46 Correct 11 ms 328 KB Output is correct
47 Correct 1 ms 328 KB Output is correct
48 Correct 1 ms 328 KB Output is correct
49 Correct 1 ms 328 KB Output is correct
50 Correct 1 ms 328 KB Output is correct
51 Correct 1 ms 328 KB Output is correct
52 Correct 1 ms 328 KB Output is correct
53 Correct 1 ms 328 KB Output is correct
54 Correct 1 ms 328 KB Output is correct
55 Correct 1 ms 328 KB Output is correct
56 Correct 1 ms 328 KB Output is correct
57 Correct 1 ms 328 KB Output is correct
58 Correct 1 ms 328 KB Output is correct
59 Correct 1 ms 328 KB Output is correct
60 Correct 1 ms 328 KB Output is correct
61 Correct 0 ms 328 KB Output is correct
62 Correct 0 ms 328 KB Output is correct
63 Correct 0 ms 328 KB Output is correct
64 Correct 1 ms 328 KB Output is correct
65 Correct 0 ms 328 KB Output is correct
66 Correct 0 ms 328 KB Output is correct
67 Correct 0 ms 328 KB Output is correct
68 Correct 0 ms 328 KB Output is correct
69 Correct 0 ms 328 KB Output is correct
70 Correct 0 ms 328 KB Output is correct
71 Correct 0 ms 328 KB Output is correct
72 Correct 0 ms 328 KB Output is correct