제출 #474343

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
474343		NhatMinh0208	Meetings (JOI19_meetings)	C++14	100 / 100	657 ms	864 KiB

meetings

#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;

컴파일 시 표준 에러 (stderr) 메시지

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 / 7
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 71 / 71