oj.uz

답안 #464779

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
464779 2021-08-14T04:41:34 Z NhatMinh0208 Coin Collecting (JOI19_ho_t4) C++14
0 / 100
 1 ms 204 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
vector<int> vec;
ll n,m,i,j,k,t,t1,u,v,a,b,res;
ll dp[100001][3];
pii(ll) coord[200001];
int main()
{
	fio;
    cin>>n;
    for (i=0;i<2*n;i++)
    {
        cin>>u>>v;
        a=u;
        b=v;
        a=min(a,n);
        a=max(a,1);
        b=min(b,2);
        b=max(b,1);
        res+=abs(a-u);
        res+=abs(b-v);
        dp[a][b]++;
    }
    // for (i=1;i<=n;i++) cout<<dp[i][1]<<' '; cout<<endl;
    // for (i=1;i<=n;i++) cout<<dp[i][2]<<' '; cout<<endl;
    u=0;

        u+=dp[1][1];
        u+=dp[1][2];
        u-=2;

    for (i=1;i<n;i++)
    {
        // cout<<u<<endl;
        if (u>0)
        {
            res+=u;
            v=u;
            u+=dp[i+1][1];
            u+=dp[i+1][2];
            u-=2;
            // cout<<dp[i][1]-1<<' '<<u<<endl;
            a=min(dp[i][1]-1,v);
            a=max(a,0);
            // cout<<a<<endl;
            dp[i][1]-=a;
            dp[i+1][1]+=a;
            v-=a;
            dp[i][2]-=v;
            dp[i+1][2]+=v;
        }
        else
        {
            u+=dp[i+1][1];
            u+=dp[i+1][2];
            u-=2;
        }
    // for (j=1;j<=n;j++) cout<<dp[j][1]<<' '; cout<<endl;
    // for (j=1;j<=n;j++) cout<<dp[j][2]<<' '; cout<<endl;
    }
    // cout<<endl;
    // for (i=1;i<=n;i++) cout<<dp[i][1]<<' '; cout<<endl;
    // for (i=1;i<=n;i++) cout<<dp[i][2]<<' '; cout<<endl;
    u=0;

        u+=dp[n][1];
        u+=dp[n][2];
        u-=2;

    for (i=n;i>1;i--)
    {
        if (u>0)
        {
            res+=u;
            v=u;
            u+=dp[i-1][1];
            u+=dp[i-1][2];
            u-=2;
            a=min(dp[i][1]-1,v);
            a=max(a,0);
            dp[i][1]-=a;
            dp[i-1][1]+=a;
            v-=a;
            dp[i][2]-=v;
            dp[i-1][2]+=v;
        }
        else
        {
            u+=dp[i-1][1];
            u+=dp[i-1][2];
            u-=2;
        }
    }
    // for (i=1;i<=n;i++) cout<<dp[i][1]<<' '; cout<<endl;
    // for (i=1;i<=n;i++) cout<<dp[i][2]<<' '; cout<<endl;
    for (i=1;i<=n;i++)
    {
        if (dp[i][1]-dp[i][2]) res++;
    }
    cout<<res;
}
// Normie28;

Compilation message

joi2019_ho_t4.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -