oj.uz

Submission #857748

# Submission time Handle Problem Language Result Execution time Memory
857748 2023-10-06T19:38:05 Z efedmrlr Making Friends on Joitter is Fun (JOI20_joitter2) C++17
1 / 100
 67 ms 600 KB 
#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 55;
const int M = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;
bool adj[N][N];
int ans = 0;
bool check(int x, int y, int z) {
    if(adj[x][y] && adj[y][z] && adj[z][y] && !adj[x][z]) {
        adj[x][z] = 1;
        ans++;
        return 1;
    }
    return 0;
}

void add_edge(int a, int b) {
    if(adj[a][b] == 1) return;
    adj[a][b] = 1;
    ans++;
    bool f = 1;
    while(f) {
        f = 0;
        for(int i = 1; i<=n; i++) {
            for(int j = i + 1; j <=n; j++) {
                for(int k = j + 1; k <=n; k++) {
                    f |= check(i,j,k);
                    f |= check(i,k,j);
                    f |= check(j,i,k);
                    f |= check(j,k,i);
                    f |= check(k,i,j);
                    f |= check(k,j,i);
                }
            }
        }
    }
}

inline void solve() {
    cin>>n>>m;
    for(int i = 1; i<=m; i++) {
        int a,b;
        cin>>a>>b;
        add_edge(a,b);
        cout<<ans<<"\n";
    }
    
}
 
signed main() {
    //freopen("milkvisits.in", "r", stdin);
    //freopen("milkvisits.out", "w", stdout);
    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message

joitter2.cpp: In function 'std::string to_string(std::string, int, int)':
joitter2.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 55 ms 348 KB Output is correct
8 Correct 53 ms 448 KB Output is correct
9 Correct 52 ms 344 KB Output is correct
10 Correct 43 ms 344 KB Output is correct
11 Correct 45 ms 596 KB Output is correct
12 Correct 42 ms 348 KB Output is correct
13 Correct 44 ms 348 KB Output is correct
14 Correct 46 ms 348 KB Output is correct
15 Correct 48 ms 348 KB Output is correct
16 Correct 43 ms 348 KB Output is correct
17 Correct 43 ms 432 KB Output is correct
18 Correct 44 ms 440 KB Output is correct
19 Correct 46 ms 348 KB Output is correct
20 Correct 54 ms 348 KB Output is correct
21 Correct 67 ms 344 KB Output is correct
22 Correct 52 ms 432 KB Output is correct
23 Correct 47 ms 548 KB Output is correct
24 Correct 54 ms 344 KB Output is correct
25 Correct 48 ms 348 KB Output is correct
26 Correct 28 ms 344 KB Output is correct
27 Correct 28 ms 348 KB Output is correct
28 Correct 32 ms 348 KB Output is correct
29 Correct 33 ms 348 KB Output is correct
30 Correct 43 ms 592 KB Output is correct
31 Correct 43 ms 348 KB Output is correct
32 Correct 47 ms 344 KB Output is correct
33 Correct 47 ms 348 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 55 ms 348 KB Output is correct
8 Correct 53 ms 448 KB Output is correct
9 Correct 52 ms 344 KB Output is correct
10 Correct 43 ms 344 KB Output is correct
11 Correct 45 ms 596 KB Output is correct
12 Correct 42 ms 348 KB Output is correct
13 Correct 44 ms 348 KB Output is correct
14 Correct 46 ms 348 KB Output is correct
15 Correct 48 ms 348 KB Output is correct
16 Correct 43 ms 348 KB Output is correct
17 Correct 43 ms 432 KB Output is correct
18 Correct 44 ms 440 KB Output is correct
19 Correct 46 ms 348 KB Output is correct
20 Correct 54 ms 348 KB Output is correct
21 Correct 67 ms 344 KB Output is correct
22 Correct 52 ms 432 KB Output is correct
23 Correct 47 ms 548 KB Output is correct
24 Correct 54 ms 344 KB Output is correct
25 Correct 48 ms 348 KB Output is correct
26 Correct 28 ms 344 KB Output is correct
27 Correct 28 ms 348 KB Output is correct
28 Correct 32 ms 348 KB Output is correct
29 Correct 33 ms 348 KB Output is correct
30 Correct 43 ms 592 KB Output is correct
31 Correct 43 ms 348 KB Output is correct
32 Correct 47 ms 344 KB Output is correct
33 Correct 47 ms 348 KB Output is correct
34 Runtime error 10 ms 600 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 55 ms 348 KB Output is correct
8 Correct 53 ms 448 KB Output is correct
9 Correct 52 ms 344 KB Output is correct
10 Correct 43 ms 344 KB Output is correct
11 Correct 45 ms 596 KB Output is correct
12 Correct 42 ms 348 KB Output is correct
13 Correct 44 ms 348 KB Output is correct
14 Correct 46 ms 348 KB Output is correct
15 Correct 48 ms 348 KB Output is correct
16 Correct 43 ms 348 KB Output is correct
17 Correct 43 ms 432 KB Output is correct
18 Correct 44 ms 440 KB Output is correct
19 Correct 46 ms 348 KB Output is correct
20 Correct 54 ms 348 KB Output is correct
21 Correct 67 ms 344 KB Output is correct
22 Correct 52 ms 432 KB Output is correct
23 Correct 47 ms 548 KB Output is correct
24 Correct 54 ms 344 KB Output is correct
25 Correct 48 ms 348 KB Output is correct
26 Correct 28 ms 344 KB Output is correct
27 Correct 28 ms 348 KB Output is correct
28 Correct 32 ms 348 KB Output is correct
29 Correct 33 ms 348 KB Output is correct
30 Correct 43 ms 592 KB Output is correct
31 Correct 43 ms 348 KB Output is correct
32 Correct 47 ms 344 KB Output is correct
33 Correct 47 ms 348 KB Output is correct
34 Runtime error 10 ms 600 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -