oj.uz

Submission #171975

# Submission time Handle Problem Language Result Execution time Memory
171975 2019-12-30T17:47:22 Z kostia244 Highway design (CEOI12_highway) C++17
0 / 100
 11 ms 7012 KB 
#include"office.h"
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pi = pair<ll, ll>;
using vpi = vector<pi>;
#define iol isOnLine
int n;
vpi bad;
void check(vpi a) {
	if(bad.empty()) {
		if(a[0].second<2||a[1].second<2||a[2].second<2) {
		for(auto i : a) bad.pb(i);
		return;
		}
		for(int i = 1; i < 3; i++) {
			if(iol(a[0].first, a[0].first+1, a[i].first)) {
				Answer(a[0].first, a[0].first+1,a[3^i].first, a[3^i].first+1);
				exit(0);
			}
		}
		Answer(a[1].first, a[1].first+1,a[2].first, a[2].first+1);
		exit(0);
	}
	for(int i = 0; i < 3; i++) {
		for(int j = i+1; j < 3; j++) {
			vpi z[2];
			for(int k = 0; k <3; k++)
				z[iol(a[i].first, a[j].first, bad[k].first)].pb(bad[k]);
			if(z[0].size()&&z[1].size()) {
				Answer(a[i].first, a[j].first, a[3^i^j].first, z[0][0].first);
			}
		}
	}

}
void solve(vpi a) {
	if(a.size()==2) {
		Answer(a[0].first, a[0].first+1,a[1].first, a[1].first+1);
		exit(0);
	}
	assert(a.size()>2);
	vpi t;
	int x = 0;
	while(x+2 < a.size()) {
		if(iol(a[x].first, a[x+1].first, a[x+2].first)) {
			t.pb({a[x].first, a[x].second+a[x+1].second+a[x+2].second});
		} else {
			check({a[x], a[x+1], a[x+2]});
		}
	}
	solve(t);
}
int main() {
	n = GetN();
	vpi a;
	for(int i = 1; i <= n; i++) a.pb({i, 1});
	solve(a);
}

Compilation message

highway.cpp: In function 'void solve(vpi)':
highway.cpp:48:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(x+2 < a.size()) {
        ~~~~^~~~~~~~~~
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
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct - Too many questions
2 Incorrect 2 ms 256 KB Output isn't correct - Too many questions
3 Incorrect 2 ms 376 KB Output isn't correct - Too many questions
4 Incorrect 2 ms 376 KB Output isn't correct - Too many questions
5 Incorrect 2 ms 376 KB Output isn't correct - Too many questions
6 Incorrect 2 ms 376 KB Output isn't correct - Too many questions
7 Incorrect 2 ms 376 KB Output isn't correct - Too many questions
8 Incorrect 2 ms 376 KB Output isn't correct - Too many questions
9 Incorrect 2 ms 376 KB Output isn't correct - Too many questions
10 Incorrect 2 ms 376 KB Output isn't correct - Too many questions
11 Incorrect 2 ms 504 KB Output isn't correct - Too many questions
12 Incorrect 2 ms 376 KB Output isn't correct - Too many questions
13 Incorrect 2 ms 504 KB Output isn't correct - Too many questions
14 Incorrect 2 ms 632 KB Output isn't correct - Too many questions
15 Incorrect 2 ms 760 KB Output isn't correct - Too many questions
16 Incorrect 2 ms 376 KB Output isn't correct - Too many questions
17 Incorrect 2 ms 376 KB Output isn't correct - Too many questions
18 Incorrect 2 ms 376 KB Output isn't correct - Too many questions
19 Incorrect 4 ms 2032 KB Output isn't correct - Too many questions
20 Incorrect 5 ms 2160 KB Output isn't correct - Too many questions
21 Incorrect 6 ms 3308 KB Output isn't correct - Too many questions
22 Incorrect 7 ms 3796 KB Output isn't correct - Too many questions
23 Incorrect 10 ms 5860 KB Output isn't correct - Too many questions
24 Incorrect 10 ms 6244 KB Output isn't correct - Too many questions
25 Incorrect 11 ms 7012 KB Output isn't correct - Too many questions