oj.uz

Submission #292207

# Submission time Handle Problem Language Result Execution time Memory
292207 2020-09-06T14:00:35 Z Nucleist Cluedo (IOI10_cluedo) C++14
100 / 100
 13 ms 384 KB 
#include "grader.h"
//Self-control leads to consistency.
#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())
#define EPS 0.000001
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0); 
	freopen((s+".in").c_str(),"r",stdin);
	freopen((s+".out").c_str(),"w",stdout);
}
void Solve(){
  set<int>hah,zah,fah;
  for (int i = 0; i < 6; ++i)
  {
  	hah.insert(i+1),fah.insert(i+1);
  }
  for (int i = 0; i < 10; ++i)
  {
  	zah.insert(i+1);
  }
  set<int>kol=hah,dol=zah,hol=fah;
  int ans=0;
  for (auto i:zah)
  {
  	for(auto it:hah){
  		for(auto it1:fah){
  			int x=it,y=i,z=it1;
  			if(kol.find(x)!=kol.end() && dol.find(y)!=dol.end() && hol.find(z)!=hol.end())
  			{
				int ah = Theory(x,y,z);
				if(!(ah)){
					return;
				}
				if(ah==1){
					kol.erase(x);
				}
				else if(ah==2){
					dol.erase(y);
				}
				else{
					hol.erase(z);
				}
  			}
  		}
  	}
  }
  return;
}

Compilation message

cluedo.cpp:6: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("O3")
      | 
cluedo.cpp:7: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    7 | #pragma GCC optimization ("unroll-loops")
      | 
cluedo.cpp: In function 'void Solve()':
cluedo.cpp:43:7: warning: unused variable 'ans' [-Wunused-variable]
   43 |   int ans=0;
      |       ^~~
cluedo.cpp: In function 'void setIO(std::string)':
cluedo.cpp:29:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   29 |  freopen((s+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
cluedo.cpp:30:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   30 |  freopen((s+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 256 KB Output is correct
2 Correct 11 ms 256 KB Output is correct
3 Correct 10 ms 256 KB Output is correct
4 Correct 11 ms 256 KB Output is correct
5 Correct 13 ms 256 KB Output is correct
6 Correct 8 ms 256 KB Output is correct
7 Correct 10 ms 256 KB Output is correct
8 Correct 11 ms 256 KB Output is correct
9 Correct 11 ms 256 KB Output is correct
10 Correct 9 ms 256 KB Output is correct
11 Correct 12 ms 256 KB Output is correct
12 Correct 10 ms 256 KB Output is correct
13 Correct 11 ms 256 KB Output is correct
14 Correct 10 ms 256 KB Output is correct
15 Correct 12 ms 384 KB Output is correct
16 Correct 7 ms 256 KB Output is correct
17 Correct 11 ms 256 KB Output is correct
18 Correct 9 ms 256 KB Output is correct

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 256 KB Output is correct
2 Correct 10 ms 256 KB Output is correct
3 Correct 11 ms 256 KB Output is correct
4 Correct 9 ms 256 KB Output is correct
5 Correct 10 ms 256 KB Output is correct
6 Correct 10 ms 256 KB Output is correct
7 Correct 11 ms 256 KB Output is correct
8 Correct 11 ms 384 KB Output is correct
9 Correct 9 ms 256 KB Output is correct
10 Correct 9 ms 256 KB Output is correct
11 Correct 11 ms 256 KB Output is correct
12 Correct 7 ms 256 KB Output is correct
13 Correct 10 ms 256 KB Output is correct
14 Correct 10 ms 256 KB Output is correct
15 Correct 9 ms 256 KB Output is correct
16 Correct 10 ms 256 KB Output is correct
17 Correct 13 ms 256 KB Output is correct
18 Correct 13 ms 256 KB Output is correct