Submission #253751

#	Time	Username	Problem	Language	Result	Execution time	Memory
253751		Nucleist	Highway design (CEOI12_highway)	C++14	40 / 100	1 ms	640 KiB

highway

#include "office.h"
#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);
}
int main(){
  int n=GetN();  
  int k=isOnLine(1,2,3);
  if(k){
    bool ka=0;
    int ans1=1,ans2=2,ans3=0,ans4=0;
    for (int i = 4; i <= n-1; i+=2)
    {
      int yo=isOnLine(ans1,i,i+1);
      if(yo){;}
      else if(!ka){ 
        int fo=isOnLine(ans1,ans2,i);
        ans3=i;
        if(fo)ans3++;
        ka=1;
      }
      else{
        int fo=isOnLine(ans1,ans2,i);
        ans4=i;
        if(fo)ans4++;
        break;
      }
    }
    Answer(ans1,ans2,ans3,ans4);
    return 0;
  }
  int j=isOnLine(1,2,4);
  int f=isOnLine(1,3,4);
  int z=isOnLine(2,3,4);
  if(!k && !j && !f && !z){
    k=isOnLine(5,1,2);
    j=isOnLine(5,1,3);
    f=isOnLine(5,1,4);
    int k1=isOnLine(5,2,3);
    int j1=isOnLine(5,2,4);
    int f1=isOnLine(5,3,4);
    if(k){
      Answer(1,2,3,4);
    }
    else if(j){
      Answer(1,3,2,4);
    }
    else if(f){
      Answer(1,4,2,3);
    }
    else if(k1){
      Answer(2,3,1,4);
    }
    else if(j1){
      Answer(2,4,1,3);
    }
    else if(f1){
      Answer(3,4,1,2);
    }
  }
  else{
    int ans1=0,ans2=0,ans3=0,ans4=0;
    if(k){
      ans1=2,ans2=3,ans3=4;
    }
    else if(j){
      ans1=2,ans2=4,ans3=3;
    }
    else if(f){
      ans1=3,ans2=4,ans3=2;
    }
    else{
      ans1=3,ans2=4,ans3=1;
    }
    for (int i = 5; i <= n-1; i+=2)
    {
      int yo=isOnLine(ans1,i,i+1);
      if(yo){;}
      else{ 
        int fo=isOnLine(ans1,ans2,i);
        ans4=i;
        if(fo)ans4++;
        break;
      }
    }
    Answer(ans1,ans2,ans3,ans4);
  }
  return 0; 
}
//code the AC sol !
// BS/queue/map

Compilation message (stderr)

highway.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
highway.cpp:6:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
 
highway.cpp: In function 'void setIO(std::__cxx11::string)':
highway.cpp:28:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen((s+".in").c_str(),"r",stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
highway.cpp:29:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen((s+".out").c_str(),"w",stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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: 40 / 100