Submission #448429

#TimeUsernameProblemLanguageResultExecution timeMemory
448429KhizriKOVANICE (COI15_kovanice)C++17
0 / 100
213 ms15372 KiB
#include <bits/stdc++.h> using namespace std; //------------------------------DEFINE------------------------------ //****************************************************************** #define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0) #define ll long long #define pb push_back #define F first #define S second #define INF 1e18 #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define pii pair<int,int> #define pll pair<ll,ll> #define OK cout<<"Ok"<<endl; #define MOD (ll)(1e9+7) #define endl "\n" //****************************************************************** //----------------------------FUNCTION------------------------------ //****************************************************************** ll gcd(ll a,ll b){ if(a>b) swap(a,b); if(a==0) return a+b; return gcd(b%a,a); } ll lcm(ll a,ll b){ return a/gcd(a,b)*b; } bool is_prime(ll n){ ll k=sqrt(n); if(n==2) return true; if(n<2||n%2==0||k*k==n) return false; for(int i=3;i<=k;i+=2){ if(n%i==0){ return false; } } return true; } //***************************************************************** //--------------------------MAIN-CODE------------------------------ const int mxn=3e5+5; int t=1,n,m,q,arr[mxn],l,r; char cc; vector<int>vt[mxn]; void dfs(int u,int val){ arr[u]=val; for(int v:vt[u]){ if(arr[v]==0){ dfs(v,val); } } } void solve(){ cin>>n>>m>>q; vector<pii>a,b; while(q--){ scanf("%d%c%d",&l,&cc,&r); if(cc=='<'){ a.pb({l,r}); } else if(cc=='>'){ b.pb({l,r}); } else{ vt[l].pb(r); vt[r].pb(l); } } for(int i=0;i<a.size();i++){ int u=a[i].F,v=a[i].S; dfs(u,1); dfs(v,2); } for(int i=0;i<b.size();i++){ int u=b[i].F,v=b[i].S; dfs(u,2); dfs(v,1); } for(int i=1;i<=m;i++){ if(arr[i]==0){ cout<<"?"<<endl; } else{ cout<<"K"<<arr[i]<<endl; } } } int main(){ IOS; //cin>>t; while(t--){ solve(); } return 0; }

Compilation message (stderr)

kovanice.cpp: In function 'void solve()':
kovanice.cpp:70:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |  for(int i=0;i<a.size();i++){
      |              ~^~~~~~~~~
kovanice.cpp:75:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |  for(int i=0;i<b.size();i++){
      |              ~^~~~~~~~~
kovanice.cpp:58:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |   scanf("%d%c%d",&l,&cc,&r);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...