oj.uz

Submission #247062

# Submission time Handle Problem Language Result Execution time Memory
247062 2020-07-10T21:25:49 Z eggag32 Highway design (CEOI12_highway) C++17
49 / 100
 6 ms 692 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include "office.h"
//#include "office.cpp"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	int n = GetN();
	int a = -1, b = -1;
	repn(i, 1, 6) repn(j, i + 1, 6) repn(k, j + 1, 6){
		if(isOnLine(i, j, k)){
			a = i, b = j;
			break;
		}
	}
	int c = -1, d = -1;
	int st = 3;
	while(true){
		int st1 = st + 1;
		while(st1 == a || st1 == b || st1 == c || st1 == d) st1++;
		while(st == a || st == b || st == st1 || st == c || st == d) st++;
		if(st1 <= n && st <= n){
			if(!isOnLine(a, st, st1)){
				if(!isOnLine(a, b, st)){
					if(c == -1) c = st;
					else if(d == -1) d = st;
				}
				if(c != -1 && d != -1) break;
				if(!isOnLine(a, b, st1)){
					if(c == -1) c = st1;
					else if(d == -1) d = st1;
				}
			}
		}
		else if(st1 > n && st <= n){
			if(!isOnLine(a, b, st)){
				if(c == -1) c = st;
				else if(d == -1) d = st;
			}
		}
		else if(st1 <= n && st > n){
			if(!isOnLine(a, b, st1)){
				if(c == -1) c = st1;
				else if(d == -1) d = st1;
			}
		}
		if(st > n && st1 > n) break;
		if(c != -1 && d != -1) break;
		st = st1 + 1;
	}
	Answer(a, b, c, d);
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/

Compilation message

office.c: In function 'int isOnLine(int, int, int)':
office.c:85:29: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
     _Fin(0, "Protocol error");
                             ^
office.c:88:29: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
     _Fin(0, "Protocol error");
                             ^
office.c:92:37: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
     _Fin(false, "Too many questions");
                                     ^
office.c:83:7: warning: unused variable 'i' [-Wunused-variable]
   int i;
       ^
office.c: In function 'void Answer(int, int, int, int)':
office.c:123:29: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
     _Fin(0, "Protocol error");
                             ^
office.c:128:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
       if( (-_Apa[na1]==_N-3) && (na2!=na1) && (nb2!=na1) ||
           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:130:30: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
          _Fin(true, "Correct");
                              ^
office.c:132:36: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
          _Fin(false, "Wrong answer");
                                    ^
office.c:134:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
       if( (-_Apa[na2]==_N-3) && (na1!=na2) && (nb1!=na2) ||
           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:136:30: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
          _Fin(true, "Correct");
                              ^
office.c:138:36: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
          _Fin(false, "Wrong answer");
                                    ^
office.c:140:33: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
       _Fin(false, "Wrong answer");
                                 ^
office.c:142:23: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   _Fin(true, "Correct");
                       ^
office.c:120:27: warning: unused variable 'pont' [-Wunused-variable]
   int na1, nb1, na2, nb2, pont;
                           ^~~~
office.c: In function 'void _doInit()':
office.c:33:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &_N);
     ~~~~~^~~~~~~~~~~

Subtask #1
49.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 5 ms 384 KB Output is partially correct - 26 queries, 2 points
2 Partially correct 5 ms 384 KB Output is partially correct - 16 queries, 1 points
3 Partially correct 4 ms 384 KB Output is partially correct - 162 queries, 2 points
4 Partially correct 5 ms 384 KB Output is partially correct - 208 queries, 2 points
5 Partially correct 5 ms 384 KB Output is partially correct - 257 queries, 2 points
6 Partially correct 4 ms 384 KB Output is partially correct - 309 queries, 2 points
7 Partially correct 4 ms 384 KB Output is partially correct - 356 queries, 2 points
8 Partially correct 4 ms 384 KB Output is partially correct - 406 queries, 2 points
9 Partially correct 5 ms 384 KB Output is partially correct - 456 queries, 2 points
10 Partially correct 4 ms 384 KB Output is partially correct - 508 queries, 2 points
11 Partially correct 5 ms 384 KB Output is partially correct - 1007 queries, 2 points
12 Partially correct 4 ms 384 KB Output is partially correct - 1009 queries, 2 points
13 Partially correct 5 ms 384 KB Output is partially correct - 1508 queries, 2 points
14 Partially correct 4 ms 384 KB Output is partially correct - 2010 queries, 2 points
15 Partially correct 4 ms 384 KB Output is partially correct - 2509 queries, 2 points
16 Partially correct 4 ms 384 KB Output is partially correct - 811 queries, 2 points
17 Partially correct 4 ms 384 KB Output is partially correct - 860 queries, 2 points
18 Partially correct 4 ms 384 KB Output is partially correct - 906 queries, 2 points
19 Partially correct 5 ms 384 KB Output is partially correct - 12713 queries, 2 points
20 Partially correct 5 ms 512 KB Output is partially correct - 15006 queries, 2 points
21 Partially correct 5 ms 512 KB Output is partially correct - 20068 queries, 2 points
22 Partially correct 5 ms 512 KB Output is partially correct - 28069 queries, 2 points
23 Partially correct 5 ms 640 KB Output is partially correct - 33896 queries, 2 points
24 Partially correct 5 ms 640 KB Output is partially correct - 40950 queries, 2 points
25 Partially correct 6 ms 692 KB Output is partially correct - 50005 queries, 2 points