oj.uz

Submission #891107

# Submission time Handle Problem Language Result Execution time Memory
891107 2023-12-22T07:51:04 Z vjudge1 Jail (JOI22_jail) C++17
21 / 100
 40 ms 10076 KB 
#include <bits/stdc++.h>
using namespace std;/*
<<<<It's never too late for a new beginning in your life>>>>
Today is hard
  tomorrow will worse
  but the day after tomorrow will be the sunshine..
 
HARD WORK BEATS TALENT WHEN TALENT DOESN'T WORK HARD............
Never give up  */
//The most CHALISHKANCHIK
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vii;
const long long N = 1e5+50, inf = 1e18, mod = 1e9+7;
  vector<int>v[N],pred(N);
  vector<int>col(N),vis(N);
  void dfs(int x,int pr){
   vis[x] = 1;
   for(auto to:v[x]){
    if(to==pr||col[to])continue;
    dfs(to,x);
   }
  }
 void solve(){
  int n,m,k;
  cin>>n;
  for(int i = 1;i<=n;i++){
   v[i].clear();
   vis[i] = 0;
   col[i] = 0;
  }
  for(int i = 1;i<n;i++){
   int a,b;
   cin>>a>>b;
   v[a].pb(b);
   v[b].pb(a);
  }
  cin>>m;
  vector<pii>g;
  for(int i = 0;i<m;i++){
   int a,b;
   cin>>a>>b;
   g.pb({a,b});
  }
  if(m<=6){
   vector<int>ind;
   for(int i = 0;i<m;i++)ind.pb(i);

   do
   {
    //~ cout<<1<<endl;
    for(int i = 1;i<=n;i++)col[i] = 0;
    for(auto to:g){
     col[to.ff] += 1;
    }
    //~ cout<<1<<endl;
    bool flag = true;
    for(auto to:ind){
     //~ cout<<1<<endl;
     int a = g[to].ff;
     int b = g[to].ss;
     //~ cout<<to<<endl;
     col[a]--;
     for(int i = 1;i<=n;i++)vis[i] = 0;
     if(col[a]>=1){
      //~ cout<<ind[0]<<"-\n";
      flag = false;
      break;
     }
     //~ if(ind[0]==2&&ind[1]==1)
     //~ cout<<col[b]<<endl;
     dfs(a,-1);
     //~ cout<<to<<endl;
     col[b] ++;
     if(vis[b]==0){
      //~ cout<<ind[0]<<"=\n";
      flag = false;
      break;
     }
    }
    if(flag){
     //~ for(auto to:ind)cout<<to<<" ";
     cout<<"Yes\n";
     return;
    }
   } while (next_permutation(all(ind)));
   cout<<"No\n";
  }
  else{
   sort(all(g));
   set<int>st;
   for(int i = m-1;i>=0;i--){
    if(!st.empty()&&*st.begin()<g[i].ss){
     cout<<"No\n";
     return;
    }
    st.insert(g[i].ss);
   }
   cout<<"Yes\n";
  }


 }
main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int t = 1;
	cin >> t;
	while(t--){
		solve();
	}
}

Compilation message

jail.cpp: In function 'void solve()':
jail.cpp:31:11: warning: unused variable 'k' [-Wunused-variable]
   31 |   int n,m,k;
      |           ^
jail.cpp: At global scope:
jail.cpp:110:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  110 | main(){
      | ^~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 9 ms 4956 KB Output is correct
5 Correct 24 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 11 ms 5180 KB Output is correct
8 Correct 4 ms 4956 KB Output is correct
9 Correct 15 ms 5396 KB Output is correct
10 Runtime error 7 ms 10076 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4952 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 5104 KB Output is correct
12 Correct 3 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4952 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 5104 KB Output is correct
12 Correct 3 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 10 ms 5192 KB Output is correct
17 Correct 3 ms 4956 KB Output is correct
18 Correct 15 ms 5196 KB Output is correct
19 Correct 2 ms 4956 KB Output is correct
20 Correct 13 ms 5196 KB Output is correct
21 Correct 15 ms 4956 KB Output is correct
22 Correct 9 ms 5180 KB Output is correct
23 Correct 3 ms 4956 KB Output is correct
24 Correct 2 ms 4952 KB Output is correct
25 Correct 40 ms 4956 KB Output is correct
26 Correct 7 ms 4956 KB Output is correct
27 Correct 8 ms 5188 KB Output is correct
28 Correct 6 ms 4956 KB Output is correct

Subtask #4
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4952 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 5104 KB Output is correct
12 Correct 3 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 10 ms 5192 KB Output is correct
17 Correct 3 ms 4956 KB Output is correct
18 Correct 15 ms 5196 KB Output is correct
19 Correct 2 ms 4956 KB Output is correct
20 Correct 13 ms 5196 KB Output is correct
21 Correct 15 ms 4956 KB Output is correct
22 Correct 9 ms 5180 KB Output is correct
23 Correct 3 ms 4956 KB Output is correct
24 Correct 2 ms 4952 KB Output is correct
25 Correct 40 ms 4956 KB Output is correct
26 Correct 7 ms 4956 KB Output is correct
27 Correct 8 ms 5188 KB Output is correct
28 Correct 6 ms 4956 KB Output is correct
29 Correct 2 ms 4956 KB Output is correct
30 Incorrect 2 ms 4968 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4952 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 5104 KB Output is correct
12 Correct 3 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 10 ms 5192 KB Output is correct
17 Correct 3 ms 4956 KB Output is correct
18 Correct 15 ms 5196 KB Output is correct
19 Correct 2 ms 4956 KB Output is correct
20 Correct 13 ms 5196 KB Output is correct
21 Correct 15 ms 4956 KB Output is correct
22 Correct 9 ms 5180 KB Output is correct
23 Correct 3 ms 4956 KB Output is correct
24 Correct 2 ms 4952 KB Output is correct
25 Correct 40 ms 4956 KB Output is correct
26 Correct 7 ms 4956 KB Output is correct
27 Correct 8 ms 5188 KB Output is correct
28 Correct 6 ms 4956 KB Output is correct
29 Correct 2 ms 4956 KB Output is correct
30 Incorrect 2 ms 4968 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 9 ms 5156 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 5204 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 3 ms 4956 KB Output is correct
11 Correct 6 ms 4956 KB Output is correct
12 Incorrect 2 ms 4952 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 9 ms 4956 KB Output is correct
5 Correct 24 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 11 ms 5180 KB Output is correct
8 Correct 4 ms 4956 KB Output is correct
9 Correct 15 ms 5396 KB Output is correct
10 Runtime error 7 ms 10076 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -