Submission #365354

#TimeUsernameProblemLanguageResultExecution timeMemory
365354FalseeeACM (COCI19_acm)C++17
50 / 50
6 ms364 KiB
#include <bits/stdc++.h> using namespace std; // c++ template (stolen from AmandOza) ! #define MOD (int)1e9+7 #define pb push_back #define eb emplace_back #define mp make_pair #define mt make_tuple #define lb lower_bound #define ub upper_bound #define f first #define s second #define resz resize #define sz(x) int((x).size()) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define FOR(i, a, b) for (int i = (a); i < (b); i++) #define F0R(i, a) for (int i = 0; i < (a); i++) #define FORd(i, a, b) for (int i = (b)-1; i >= (a); i--) #define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--) #define trav(a, x) for (auto &a : x) #define L1(u, ...) [&](auto &&u) { return __VA_ARGS__; } #define L2(u, v, ...) [&](auto &&u, auto &&v) { return __VA_ARGS__; } #define sort_by(x, y) sort(all(x), [&](const auto &l, const auto &r) { return y; }) using ll = long long; using vi = vector<int>; using vvi = vector<vi>; using vll = vector<ll>; using vvll = vector<vll>; using vb = vector<bool>; using vd = vector<double>; using vs = vector<string>; using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<double, double>; using vpii = vector<pii>; using vpll = vector<pll>; using vpdd = vector<pdd>; template <typename T> void ckmin(T &a, const T &b) { a = min(a, b); } template <typename T> void ckmax(T &a, const T &b) { a = max(a, b); } mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); void usaco(string filename) { // #pragma message("be careful, freopen may be wrong") freopen((filename + ".in").c_str(), "r", stdin); freopen((filename + ".out").c_str(), "w", stdout); } namespace __input { template <class T1, class T2> void re(pair<T1, T2> &p); template <class T> void re(vector<T> &a); template <class T, size_t SZ> void re(array<T, SZ> &a); template <class T> void re(T &x) { cin >> x; } void re(double &x) { string t; re(t); x = stod(t); } template <class Arg, class... Args> void re(Arg &first, Args &...rest) { re(first); re(rest...); } template <class T1, class T2> void re(pair<T1, T2> &p) { re(p.f, p.s); } template <class T> void re(vector<T> &a) { F0R (i, sz(a)) re(a[i]); } template <class T, size_t SZ> void re(array<T, SZ> &a) { F0R (i, SZ) re(a[i]); } } using namespace __input; namespace __output { template <typename T> struct is_outputtable { template <typename C> static constexpr decltype(declval<ostream &>() << declval<const C &>(), bool()) test(int) { return true; } template <typename C> static constexpr bool test(...) { return false; } static constexpr bool value = test<T>(int()); }; template <class T, typename V = decltype(declval<const T &>().begin()), typename S = typename enable_if<!is_outputtable<T>::value, bool>::type> void pr(const T &x); template <class T, typename V = decltype(declval<ostream &>() << declval<const T &>())> void pr(const T &x) { cout << x; } template <class T1, class T2> void pr(const pair<T1, T2> &x); template <class Arg, class... Args> void pr(const Arg &first, const Args &...rest) { pr(first); pr(rest...); } template <class T, bool pretty = true> void prContain(const T &x) { if (pretty) pr("{"); bool fst = 1; for (const auto &a : x) pr(!fst ? pretty ? ", " : " " : "", a), fst = 0; if (pretty) pr("}"); } template <class T> void pc(const T &x) { prContain<T, false>(x); pr("\n"); } template <class T1, class T2> void pr(const pair<T1, T2> &x) { pr("{", x.f, ", ", x.s, "}"); } template <class T, typename V, typename S> void pr(const T &x) { prContain(x); } void ps() { pr("\n"); } template <class Arg> void ps(const Arg &first) { pr(first); ps(); } template <class Arg, class... Args> void ps(const Arg &first, const Args &...rest) { pr(first, " "); ps(rest...); } } using namespace __output; #define TRACE(x) x #define __pn(x) pr(#x, " = ") #ifdef NOAM_LOCAL #define pd(...) pr("\033[1;31m"), __pn((__VA_ARGS__)), ps(__VA_ARGS__), pr("\033[0m"), cout << flush #else #define pd(...) #endif namespace __algorithm { template <typename T> void dedup(vector<T> &v) { sort(all(v)); v.erase(unique(all(v)), v.end()); } template <typename T> typename vector<T>::const_iterator find(const vector<T> &v, const T &x) { auto it = lower_bound(all(v), x); return it != v.end() && *it == x ? it : v.end(); } template <typename T> size_t index(const vector<T> &v, const T &x) { auto it = find(v, x); assert(it != v.end() && *it == x); return it - v.begin(); } template <typename T1, typename T2> typename vector<pair<T1, T2>>::iterator lower_bound(const vector<pair<T1, T2>> &v, const T1 &x) { return lower_bound(all(v), x, [](pair<T1, T2> a, pair<T1, T2> b) { return a.f < b.f; }); } template <typename T1, typename T2> typename vector<pair<T1, T2>>::iterator upper_bound(const vector<pair<T1, T2>> &v, const T1 &x) { return upper_bound(all(v), x, [](pair<T1, T2> a, pair<T1, T2> b) { return a.f < b.f; }); } template <typename I, typename B, typename E> struct reversed { I &v_; explicit reversed(I &v) : v_{v} {} B begin() const { return rbegin(v_); } E end() const { return rend(v_); } }; } using namespace __algorithm; struct __monostate { friend istream &operator>>(istream &is, const __attribute__((unused)) __monostate &ms) { return is; } friend ostream &operator<<(ostream &os, const __attribute__((unused)) __monostate &ms) { return os; } } ms; namespace __io { void setIn(string s) { freopen(s.c_str(), "r", stdin); } void setOut(string s) { freopen(s.c_str(), "w", stdout); } void setIO() { ios_base::sync_with_stdio(0); cin.tie(0); cout << setprecision(15); } } using namespace __io; const int mxN = 0; struct team{ string name; int solveds; ll p_time; team(){ solveds = 0; p_time = 0; } bool operator < (team &other){ if(solveds == other.solveds){ if(p_time == other.p_time){ return name < other.name; } return p_time < other.p_time; } return solveds > other.solveds; } }; int main(){ int n, m; cin >> n >> m; string s; team teams[n]; cout << endl; for(int i = 0; i <n-1 ; ++i){ team t; cin >>s; t.name = s; for(int task = 0; task < m; ++task){ string kind; cin >> kind; if(kind[0] != '-'){ char times=kind[1]; char dummy=kind[2]; string date=kind.substr(3, 8); // cout << s << " " << kind[0] << " " << times << " " << dummy << " " << date << endl; int d= 0; // hours d+=(date[1]-'0')*60*60; // min d+=(date[3]-'0')*10*60; d+=(date[4]-'0')*60; // seconds d+=(date[6]-'0')*10; d+=(date[7]-'0'); t.p_time+=d; t.p_time+=(20*(times-'0')*60); t.solveds++; }else{ // cout << s << " " << kind << endl; // t.p_time+=(20*(kind[1]-'0')*60); } } if(s == "NijeZivotJedanACM"){ i--; continue; } teams[i]=t; } cin >> s; team t; t.name=s; for(int task = 0; task < m; ++task){ string kind; cin >> kind; if(kind[0] != '-'){ char times=kind[1]; char dummy=kind[2]; string date=kind.substr(3, 8); // cout << s << " " << kind[0] << " " << times << " " << dummy << " " << date << endl; int d= 0; // hours d+=(date[1]-'0')*60*60; // min d+=(date[3]-'0')*10*60; d+=(date[4]-'0')*60; // seconds d+=(date[6]-'0')*10; d+=(date[7]-'0'); t.p_time+=d; t.p_time+=(20*(times-'0')*60); t.solveds++; }else{ // cout << s << " " << kind << endl; // t.p_time+=(20*(kind[1]-'0')*60); } } teams[n-1]=t; sort(teams, teams+(n)); for(int i = 0; i < n; ++i){ // cout << teams[i].name << " " << teams[i].solveds << " " << teams[i].p_time << endl; if(teams[i].name == "NijeZivotJedanACM"){ cout << i+1 << endl; return 0; // return 0; } } }

Compilation message (stderr)

acm.cpp: In function 'int main()':
acm.cpp:160:22: warning: unused variable 'dummy' [-Wunused-variable]
  160 |                 char dummy=kind[2];
      |                      ^~~~~
acm.cpp:195:22: warning: unused variable 'dummy' [-Wunused-variable]
  195 |                 char dummy=kind[2];
      |                      ^~~~~
acm.cpp: In function 'void usaco(std::string)':
acm.cpp:57:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   57 |  freopen((filename + ".in").c_str(), "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
acm.cpp:58:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   58 |  freopen((filename + ".out").c_str(), "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
acm.cpp: In function 'void __io::setIn(std::string)':
acm.cpp:119:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  119 |     void setIn(string s) { freopen(s.c_str(), "r", stdin); }
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
acm.cpp: In function 'void __io::setOut(std::string)':
acm.cpp:120:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  120 |     void setOut(string s) { freopen(s.c_str(), "w", stdout); }
      |                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...