結果

問題 No.483 マッチ並べ
ユーザー torus711
提出日時 2017-02-10 23:03:47
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 4,620 bytes
コンパイル時間 1,140 ms
コンパイル使用メモリ 105,712 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-12-29 08:20:21
合計ジャッジ時間 2,451 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 53
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp:44:66: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   44 | template <> struct getv_fmt< int >{ static constexpr char *fmt = "%d"; };
      |                                                                  ^~~~
main.cpp:45:72: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   45 | template <> struct getv_fmt< long long >{ static constexpr char *fmt = "%lld"; };
      |                                                                        ^~~~~~

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>
using namespace std;
using namespace placeholders;
using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;
template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i 
    ) << v[i]; } return s; }
template < typename T > struct getv_fmt;
template <> struct getv_fmt< int >{ static constexpr char *fmt = "%d"; };
template <> struct getv_fmt< long long >{ static constexpr char *fmt = "%lld"; };
template < typename T > void getv( std::vector< T > &v ){ for_each( begin( v ), end( v ), []( T &a ){ scanf( getv_fmt< T >::fmt, &a ); } ); };
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }
#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( 
    remove_all_extents< decltype( a ) >::type )
#define DRANGE( c, p ) begin( c ), begin( c ) + ( p ), end( c )
#define SZ( v ) ( (int)( v ).size() )
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )
template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter
#define MP make_pair
#define fst first
#define snd second
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
class UnionFind
{
private:
    const int N;
    vector<int> parent;
    vector<int> rank;
    int groups_;
    std::vector< int > sizes;
public:
    UnionFind( int n ) : N( n ), parent( N ), rank( N, 0 ), groups_( N ), sizes( N, 1 )
    {
        std::iota( parent.begin(), parent.end(), 0 );
        return;
    }
    int find( int x )
    {
        if ( parent[x] == x )
        {
            return x;
        }
        return parent[x] = find( parent[x] );
    }
    bool same( int x, int y )
    {
        return find( x ) == find( y );
    }
    bool unite( int x, int y )
    {
        x = find( x );
        y = find( y );
        if ( x == y )
        {
            return false;
        }
        if ( rank[x] < rank[y] )
        {
            parent[x] = y;
            sizes[y] += sizes[x];
        }
        else
        {
            parent[y] = x;
            sizes[x] += sizes[y];
            if ( rank[x] == rank[y] )
            {
                ++rank[x];
            }
        }
        --groups_;
        return true;
    }
    int groups() const
    {
        return groups_;
    }
    int groupSize( const int x )
    {
        return sizes[ find( x ) ];
    }
};
// UnionFind( N )
// find( x )
// same( x, y )
// unite( x, y )
// groups()
// groupSize( x )
int main()
{
    cin.tie( 0 );
    ios::sync_with_stdio( false );
    cout << setprecision( 12 ) << fixed;
    int N;
    cin >> N;
    UnionFind uf( 100 * 100 );
    VI duplicates( 100 * 100 );
    REP( N )
    {
        int y1, x1, y2, x2;
        cin >> y1 >> x1 >> y2 >> x2;
        --y1, --x1, --y2, --x2;
        const int u = y1 * 100 + x1, v = y2 * 100 + x2;
        const int d = duplicates[ uf.find( u ) ] + duplicates[ uf.find( v ) ] + !uf.unite( u, v );
        if ( 2 <= d )
        {
            cout << "NO" << endl;
            return 0;
        }
        duplicates[ uf.find( u ) ] = d;
    }
    cout << "YES" << endl;
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0