oj.uz

Submission #380983

# Submission time Handle Problem Language Result Execution time Memory
380983 2021-03-24T02:17:11 Z Aaeria Restore Array (RMI19_restore) C++14
100 / 100
 182 ms 1408 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
//#pragma GCC optimize("Ofast") //#pragma GCC optimize "unroll-loops" //#pragma GCC target "sse,sse2,sse3,sse4,abm,avx,avx2,fma,mmx,popcnt,tune=native" //#pragma GCC optimize "prefetch-loop-arrays"
using namespace std; using namespace __gnu_pbds;
#define foru(i,a,b) for(int i=(a);i<(b);i++)
#define ford(i,a,b) for(int i=(a);i>=(b);i--)
#define fori(a,b) foru(i,a,b)
#define forj(a,b) foru(j,a,b)
#define fork(a,b) foru(k,a,b)
#define seto(x,i) memset(x,i,sizeof x)
#define pf first
#define ps second
#define pb push_back
#define eb emplace_back
#define em emplace
#define mp make_pair
#define mt make_tuple
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __builtin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define P2(x) (1LL<<(x))
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)
#if __SIZEOF_INT128__
    typedef __int128_t i128; typedef __uint128_t ui128;
#else
    typedef int64_t i128; typedef uint64_t ui128;
#endif
typedef int64_t ll;  typedef uint64_t ull; typedef int8_t byte; typedef long double lld;
typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef pair<lld,lld> pdd;
template<class T1,class T2> using ordered_map=tree<T1,T2,less<T1>,rb_tree_tag,tree_order_statistics_node_update>; template<class T1> using ordered_set=ordered_map<T1,null_type>;
template<class T> using minpq=std::priority_queue<T,vector<T>,greater<T>>; template<class T> using maxpq=std::priority_queue<T,vector<T>,less<T>>;
template<class T> using minpairingheap=__gnu_pbds::priority_queue<T,greater<T>,pairing_heap_tag>; template<class T>using maxpairingheap=__gnu_pbds::priority_queue<T,less<T>,pairing_heap_tag>;
const int inf=0x3f3f3f3f,MOD=1e9+7; const ll INF=0x3f3f3f3f3f3f3f3f; const lld PI=acos((lld)-1);
const ll SEED=443214^chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count();
mt19937 randgen(SEED); int randint(int a, int b){return uniform_int_distribution<int>(a,b)(randgen);} ll randll(ll a, ll b){return uniform_int_distribution<ll>(a,b)(randgen);}
ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
ll fpow(ll a,ll b,ll M=MOD){ll ret=1;for(;b;b>>=1){if(b&1) ret=ret*a%M;a=a*a%M;}return ret;}
template<class T1,class T2>constexpr const auto _min(const T1&x,const T2&y){return x<y?x:y;} template<class T,class...Ts>constexpr auto _min(const T&x,const Ts&...xs){return _min(x,_min(xs...));}
template<class T1,class T2>constexpr const auto _max(const T1&x,const T2&y){return x>y?x:y;} template<class T,class...Ts>constexpr auto _max(const T&x,const Ts&...xs){return _max(x,_max(xs...));}
#define min(...) _min(__VA_ARGS__)
#define max(...) _max(__VA_ARGS__)
template<class T1,class T2>constexpr bool ckmin(T1&x,const T2&y){return x>y?x=y,1:0;} template<class T,class...Ts>constexpr bool ckmin(T&x,const Ts&...xs){return ckmin(x,min(xs...));}
template<class T1,class T2>constexpr bool ckmax(T1&x,const T2&y){return x<y?x=y,1:0;} template<class T,class...Ts>constexpr bool ckmax(T&x,const Ts&...xs){return ckmax(x,max(xs...));}
struct chash{
    static ll splitmix64(ll x){x+=0x9e3779b97f4a7c15; x=(x^(x>>30))*0xbf58476d1ce4e5b9; x=(x^(x>>27))*0x94d049bb133111eb; return x^(x>>31);}
    template<class T> size_t operator()(const T &x) const{return splitmix64(hash<T>()(x)+SEED);}
    template<class T1,class T2> size_t operator()(const pair<T1,T2>&x)const{return 31*operator()(x.first)+operator()(x.second);}};
void fIn(string s){freopen(s.c_str(),"r",stdin);} void fOut(string s){freopen(s.c_str(),"w",stdout);} void fIO(string s){fIn(s+".in"); fOut(s+".out");}
string to_string(char c){return string(1,c);} string to_string(char* s){return (string)s;} string to_string(string s){return s;}
template<class T> string to_string(complex<T> c){stringstream ss; ss<<c; return ss.str();} template<class T1,class T2> string to_string(pair<T1,T2> p){return "("+to_string(p.pf)+","+to_string(p.ps)+")";}
template<size_t SZ> string to_string(bitset<SZ> b){string ret=""; fori(0,SZ) ret+=char('0'+b[i]); return ret;}
template<class T> string to_string(T v){string ret="{"; for(const auto& x:v) ret+=to_string(x)+","; return ret+"}";}
void DBG(){cerr<<"]"<<endl;} template<class T,class... Ts> void DBG(T x,Ts... xs){cerr<<to_string(x); if(sizeof...(xs)) cerr<<", "; DBG(xs...);}
#ifdef LOCAL
    #define dbg(...) cerr<<"Line("<< __LINE__<<") -> ["<<#__VA_ARGS__<<"]: [", DBG(__VA_ARGS__)
#else
    #define dbg(...) 0
#endif
#define nl "\n"

const int N=5010,M=MOD;
int n,m,a,b,c,d,e,mi[N],ma[N];
vector<pii> gr[2][N];
queue<int> toV;

int main(){
    cin.tie(0)->sync_with_stdio(0); //fIn("input.small-2");
    cin>>n>>m;
    fori(0,m){
        cin>>a>>b>>c>>d; a++; b++; e=c+1-d;
        e=b-a+1-c+d;
        gr[d^1][a-1].eb(b,e);
        gr[d][b].eb(a-1,-e);
    }
    fori(0,n){
        gr[0][i].eb(i+1,0); gr[1][i].eb(i+1,1);
        gr[1][i+1].eb(i,0); gr[0][i+1].eb(i,-1);
    }
    iota(ma,ma+n+1,0); seto(mi,-1); mi[0]=0;
    toV.em(0);
    while(sz(toV)){
        int v=toV.front(); toV.pop();
        if(mi[v]>ma[v]) break;
        for(auto i:gr[0][v]) if(mi[i.pf]<mi[v]+i.ps){
            mi[i.pf]=mi[v]+i.ps;
            toV.em(i.pf);
        }
    }
    toV.em(0);
    while(sz(toV)){
        int v=toV.front(); toV.pop();
        if(mi[v]>ma[v]) break;
        for(auto i:gr[1][v]) if(ma[i.pf]>ma[v]+i.ps){
            ma[i.pf]=ma[v]+i.ps;
            toV.em(i.pf);
        }
    }
    fori(0,n+1) dbg(mi[i],ma[i]);
    fori(0,n+1) if(mi[i]>ma[i]) return cout<<-1,0;
    fori(1,n+1) cout<<(mi[i]>mi[i-1]? 1:0)<<" ";
    return 0;
}
/**

*/

Compilation message

restore.cpp: In function 'int main()':
restore.cpp:63:22: warning: statement has no effect [-Wunused-value]
   63 |     #define dbg(...) 0
      |                      ^
restore.cpp:104:17: note: in expansion of macro 'dbg'
  104 |     fori(0,n+1) dbg(mi[i],ma[i]);
      |                 ^~~
restore.cpp: In function 'void fIn(std::string)':
restore.cpp:54:27: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   54 | void fIn(string s){freopen(s.c_str(),"r",stdin);} void fOut(string s){freopen(s.c_str(),"w",stdout);} void fIO(string s){fIn(s+".in"); fOut(s+".out");}
      |                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
restore.cpp: In function 'void fOut(std::string)':
restore.cpp:54:78: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   54 | void fIn(string s){freopen(s.c_str(),"r",stdin);} void fOut(string s){freopen(s.c_str(),"w",stdout);} void fIO(string s){fIn(s+".in"); fOut(s+".out");}
      |                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 620 KB Output is correct
2 Correct 1 ms 620 KB Output is correct
3 Correct 1 ms 620 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 620 KB Output is correct
6 Correct 1 ms 620 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 620 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1260 KB Output is correct
2 Correct 8 ms 1296 KB Output is correct
3 Correct 14 ms 1388 KB Output is correct
4 Correct 11 ms 1388 KB Output is correct
5 Correct 8 ms 1388 KB Output is correct
6 Correct 6 ms 1388 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1260 KB Output is correct
2 Correct 8 ms 1296 KB Output is correct
3 Correct 14 ms 1388 KB Output is correct
4 Correct 11 ms 1388 KB Output is correct
5 Correct 8 ms 1388 KB Output is correct
6 Correct 6 ms 1388 KB Output is correct
7 Correct 14 ms 1388 KB Output is correct
8 Correct 15 ms 1388 KB Output is correct
9 Correct 16 ms 1408 KB Output is correct
10 Correct 24 ms 1388 KB Output is correct
11 Correct 6 ms 1388 KB Output is correct
12 Correct 6 ms 1388 KB Output is correct
13 Correct 21 ms 1388 KB Output is correct
14 Correct 34 ms 1388 KB Output is correct
15 Correct 67 ms 1388 KB Output is correct
16 Correct 182 ms 1388 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 620 KB Output is correct
2 Correct 1 ms 620 KB Output is correct
3 Correct 1 ms 620 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 620 KB Output is correct
6 Correct 1 ms 620 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 13 ms 1260 KB Output is correct
12 Correct 8 ms 1296 KB Output is correct
13 Correct 14 ms 1388 KB Output is correct
14 Correct 11 ms 1388 KB Output is correct
15 Correct 8 ms 1388 KB Output is correct
16 Correct 6 ms 1388 KB Output is correct
17 Correct 14 ms 1388 KB Output is correct
18 Correct 15 ms 1388 KB Output is correct
19 Correct 16 ms 1408 KB Output is correct
20 Correct 24 ms 1388 KB Output is correct
21 Correct 6 ms 1388 KB Output is correct
22 Correct 6 ms 1388 KB Output is correct
23 Correct 21 ms 1388 KB Output is correct
24 Correct 34 ms 1388 KB Output is correct
25 Correct 67 ms 1388 KB Output is correct
26 Correct 182 ms 1388 KB Output is correct
27 Correct 10 ms 1388 KB Output is correct
28 Correct 10 ms 1388 KB Output is correct
29 Correct 11 ms 1388 KB Output is correct
30 Correct 10 ms 1388 KB Output is correct
31 Correct 11 ms 1388 KB Output is correct
32 Correct 10 ms 1388 KB Output is correct
33 Correct 6 ms 1388 KB Output is correct
34 Correct 6 ms 1388 KB Output is correct
35 Correct 10 ms 1388 KB Output is correct
36 Correct 13 ms 1388 KB Output is correct