oj.uz

Submission #949634

# Submission time Handle Problem Language Result Execution time Memory
949634 2024-03-19T13:31:08 Z GrindMachine Highway design (CEOI12_highway) C++17
0 / 100
 1 ms 1500 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "office.h"

int f(int x, int y, int z){
	return isOnLine(x,y,z);
}

void solve(int test_case)
{
	int n = GetN();
	int res1 = f(1,2,3);
	vector<int> a,b;
	rep1(i,n) b.pb(i);

	if(!res1){
		int res2 = f(4,5,6);
		if(!res2){
			// brute force
			return;
		}

		for(int i = 4; i <= 6; ++i){
			b.erase(find(all(b),i));
			a.pb(i);
		}
	}
	else{
		for(int i = 1; i <= 3; ++i){
			b.erase(find(all(b),i));
			a.pb(i);
		}
	}

	vector<int> c;

	while(true){
		int x = b[sz(b)-1], y = b[sz(b)-2];
		if(f(a[0],x,y)) conts;
		if(f(a[0],a[1],x)){
			c.pb(y);
			b.pop_back(), b.pop_back();
		}
		else{
			c.pb(x);
			b.pop_back();
		}

		if(sz(c) >= 2){
			Answer(a[0],a[1],c[0],c[1]);
		}
	}
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

office.c: In function 'int isOnLine(int, int, int)':
office.c:85:13: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   85 |     _Fin(0, "Protocol error");
      |             ^~~~~~~~~~~~~~~~
office.c:88:13: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   88 |     _Fin(0, "Protocol error");
      |             ^~~~~~~~~~~~~~~~
office.c:92:17: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   92 |     _Fin(false, "Too many questions");
      |                 ^~~~~~~~~~~~~~~~~~~~
office.c:83:7: warning: unused variable 'i' [-Wunused-variable]
   83 |   int i;
      |       ^
office.c: In function 'void Answer(int, int, int, int)':
office.c:123:13: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  123 |     _Fin(0, "Protocol error");
      |             ^~~~~~~~~~~~~~~~
office.c:128:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  128 |       if( (-_Apa[na1]==_N-3) && (na2!=na1) && (nb2!=na1) ||
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:130:21: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  130 |          _Fin(true, "Correct");
      |                     ^~~~~~~~~
office.c:132:22: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  132 |          _Fin(false, "Wrong answer");
      |                      ^~~~~~~~~~~~~~
office.c:134:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  134 |       if( (-_Apa[na2]==_N-3) && (na1!=na2) && (nb1!=na2) ||
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:136:21: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  136 |          _Fin(true, "Correct");
      |                     ^~~~~~~~~
office.c:138:22: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  138 |          _Fin(false, "Wrong answer");
      |                      ^~~~~~~~~~~~~~
office.c:140:19: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  140 |       _Fin(false, "Wrong answer");
      |                   ^~~~~~~~~~~~~~
office.c:142:14: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
  142 |   _Fin(true, "Correct");
      |              ^~~~~~~~~
office.c:120:27: warning: unused variable 'pont' [-Wunused-variable]
  120 |   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]
   33 |     scanf("%d", &_N);
      |     ~~~~~^~~~~~~~~~~

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 504 KB Output isn't correct - Too many questions
2 Incorrect 0 ms 596 KB Output isn't correct - Too many questions
3 Incorrect 0 ms 344 KB Output isn't correct - Too many questions
4 Incorrect 0 ms 344 KB Output isn't correct - Too many questions
5 Incorrect 0 ms 344 KB Output isn't correct - Too many questions
6 Incorrect 0 ms 344 KB Output isn't correct - Too many questions
7 Incorrect 0 ms 344 KB Output isn't correct - Too many questions
8 Incorrect 1 ms 344 KB Output isn't correct - Too many questions
9 Incorrect 0 ms 344 KB Output isn't correct - Too many questions
10 Incorrect 1 ms 344 KB Output isn't correct - Too many questions
11 Incorrect 0 ms 344 KB Output isn't correct - Too many questions
12 Incorrect 0 ms 344 KB Output isn't correct - Too many questions
13 Incorrect 0 ms 344 KB Output isn't correct - Too many questions
14 Incorrect 0 ms 344 KB Output isn't correct - Too many questions
15 Incorrect 0 ms 344 KB Output isn't correct - Too many questions
16 Incorrect 0 ms 600 KB Output isn't correct - Too many questions
17 Incorrect 0 ms 344 KB Output isn't correct - Too many questions
18 Incorrect 0 ms 344 KB Output isn't correct - Too many questions
19 Incorrect 1 ms 600 KB Output isn't correct - Too many questions
20 Incorrect 1 ms 600 KB Output isn't correct - Too many questions
21 Incorrect 1 ms 868 KB Output isn't correct - Too many questions
22 Incorrect 1 ms 988 KB Output isn't correct - Too many questions
23 Incorrect 1 ms 1244 KB Output isn't correct - Too many questions
24 Incorrect 1 ms 1244 KB Output isn't correct - Too many questions
25 Incorrect 1 ms 1500 KB Output isn't correct - Too many questions