oj.uz

Submission #200244

# Submission time Handle Problem Language Result Execution time Memory
200244 2020-02-05T18:14:27 Z Nucleist Carnival (CEOI14_carnival) C++14
100 / 100
 16 ms 392 KB 
#include <bits/stdc++.h> 
using namespace std; 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
bool vis[151];
int color[151];
int main()
{
  //flash;
  int n;
  cin>>n;
  ve hedi;
  for (int i = 0; i < n; ++i)
  {
  	cout<<1+hedi.size()<<" ";
  	for (int j = 0; j < hedi.size(); ++j)
  	{
  		cout<<hedi[j]<<" ";
  	}
  	cout<<i+1;
  	cout<<endl;
  	int yo;cin>>yo;
  	if(yo>hedi.size())
  	{
  		vis[i]=1;
  		hedi.pb(i+1);
  	}
  }
  for (int i = 0; i < hedi.size(); ++i)
  {
  	color[hedi[i]]=i+1;
  }
  for (int i = 0; i < n; ++i)
  {
  	if(!vis[i])
  	{
  		int low=0,high=hedi.size()-1;
  		while(low<=high)
  		{
  			int mid = (low+high)/2;
  			cout<<(mid-low)+2<<" ";
  			for (int i = low; i <= mid; ++i)
  			{
  				cout<<hedi[i]<<" ";
  			}
  			cout<<i+1;
  			cout<<endl;
  			int yo;
  			cin>>yo;
  			if(low==high)
  			{
  				color[i+1]=color[hedi[low]];
  				break;
  			}
  			else if(yo==(mid-low)+2)
  			{
  				low=mid+1;
  			}
  			else
  			{
  				high=mid;
  			}
  		}
  	}
  }
  cout<<0<<" ";
  for (int i = 1; i <= n; ++i)
  {
  	cout<<color[i]<<" ";
  }
  return 0;
}
//code the AC sol !
// BS/queue/map

Compilation message

carnival.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
carnival.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
 
carnival.cpp: In function 'int main()':
carnival.cpp:35:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < hedi.size(); ++j)
                    ~~^~~~~~~~~~~~~
carnival.cpp:42:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(yo>hedi.size())
       ~~^~~~~~~~~~~~
carnival.cpp:48:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < hedi.size(); ++i)
                   ~~^~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 392 KB Output is correct
2 Correct 13 ms 248 KB Output is correct
3 Correct 10 ms 248 KB Output is correct
4 Correct 8 ms 376 KB Output is correct
5 Correct 11 ms 248 KB Output is correct
6 Correct 9 ms 312 KB Output is correct
7 Correct 12 ms 248 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 248 KB Output is correct
2 Correct 15 ms 376 KB Output is correct
3 Correct 10 ms 280 KB Output is correct
4 Correct 8 ms 376 KB Output is correct
5 Correct 13 ms 376 KB Output is correct
6 Correct 14 ms 376 KB Output is correct
7 Correct 13 ms 376 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 200 KB Output is correct
2 Correct 11 ms 376 KB Output is correct
3 Correct 15 ms 376 KB Output is correct
4 Correct 8 ms 376 KB Output is correct
5 Correct 13 ms 248 KB Output is correct
6 Correct 16 ms 376 KB Output is correct
7 Correct 14 ms 248 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 376 KB Output is correct
2 Correct 11 ms 248 KB Output is correct
3 Correct 10 ms 252 KB Output is correct
4 Correct 8 ms 376 KB Output is correct
5 Correct 14 ms 248 KB Output is correct
6 Correct 14 ms 248 KB Output is correct
7 Correct 15 ms 300 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 248 KB Output is correct
2 Correct 13 ms 248 KB Output is correct
3 Correct 12 ms 248 KB Output is correct
4 Correct 12 ms 376 KB Output is correct
5 Correct 12 ms 248 KB Output is correct
6 Correct 10 ms 376 KB Output is correct
7 Correct 9 ms 248 KB Output is correct