Submission #493504

#TimeUsernameProblemLanguageResultExecution timeMemory
493504Carmel_Ab1Colors (RMI18_colors)C++17
0 / 100
1000 ms524292 KiB
#include<bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //using namespace __gnu_pbds; using namespace std; typedef long double ld; typedef long long ll; typedef unsigned long long ull; typedef vector<int>vi; typedef vector<vector<int>>vvi; typedef vector<ll>vl; typedef vector<vl> vvl; typedef pair<int,int>pi; typedef pair<ll,ll> pl; typedef vector<pl> vpl; typedef vector<ld> vld; typedef pair<ld,ld> pld; typedef vector<pi> vpi; //typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set; template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;} #define all(x) x.begin(),x.end() #define YES out("YES") #define NO out("NO") #define out(x){cout << x << "\n"; return;} #define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) #define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";} #define pb push_back #define umap unordered_map template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;} template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;} void usaco(string taskname){ string fin = taskname + ".in"; string fout = taskname + ".out"; const char* FIN = fin.c_str(); const char* FOUT = fout.c_str(); freopen(FIN, "r", stdin); freopen(FOUT, "w", stdout); } template<typename T> void read(vector<T>& v){ int n=v.size(); for(int i=0; i<n; i++) cin >> v[i]; } template<typename T> vector<T>UNQ(vector<T>a){ vector<T>ans; for(T t:a) if(ans.empty() || t!=ans.back()) ans.push_back(t); return ans; } ll ceil(ll a,ll b){ ll ans=a/b; if(a%b)ans++; return ans; } ld log (ld a,ld b){return log(b)/log(a);} ll power(ll base, ll exp,ll M=1e18){//(base^exp)%M ll ans=1; while(exp){ if(exp%2==1)ans=((ans%M)*(base%M))%M; base=((base%M)*(base%M))%M; exp/=2; } return ans; } string to_base(int n,int new_base){ string s; int nn=n; while(nn){ s+=to_string(nn%new_base); nn/=new_base; } reverse(all(s)); return s; } ll gcd(ll a,ll b){ if(a<b)swap(a,b); if(b==0)return a; return gcd(b,a%b); } ll lcm(ll a,ll b){ ll x= (a/gcd(a,b)); return b*x; } vl generate_array(ll n,ll mn=1,ll mx=1e18+1){ if(mx==1e18+1) mx=n; vl ans(n); for(int i=0; i<n;i++) ans[i]=(mn+rand()%(mx-mn+1)); return ans; } string substr(string s,int l,int r){ string ans; for(int i=l; i<=r; i++) ans+=s[i]; return ans; } void solve(); int main(){ GLHF; int t=1; cin >> t; while(t--) solve(); } vvi g; vi a,b; vector<bool>vis; void dfs(int src,int par,int col){ vis[src]=1; for(int nbr:g[src]) if(nbr!=par && b[nbr]==col) dfs(nbr,src,col); } void solve() { int n,m; cin >> n >> m; a.resize(n+1); b.resize(n+1); g.resize(n+1); for(int i=1; i<=n; i++) cin >> a[i]; for(int i=1; i<=n; i++) cin >> b[i]; for(int i=0; i<m; i++){ int u,v; cin >> u >> v; g[u].pb(v); g[v].pb(u); } vi ord; for(int i=1; i<=n; i++) ord.pb(i); sort(all(ord),[&](int x,int y){return a[x]<a[y];}); vis.resize(n+1); for(int i=0; i<n; i++){ int src=ord[i]; if(vis[src])continue; dfs(i,i,b[i]); } for(int i=1; i<=n; i++) if(!vis[i])out(0) out(1) }

Compilation message (stderr)

colors.cpp: In function 'void usaco(std::string)':
colors.cpp:41:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
colors.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...